Periodic and non-periodic min-max equations

被引：0

作者：

Schwiegelshohn, U

Thiele, L

机构：

[1] Univ Dortmund, Comp Engn Inst, D-44221 Dortmund, Germany

[2] Swiss Fed Inst Technol, Comp Engn & Commun Lab, CH-8092 Zurich, Switzerland

来源：

AUTOMATA, LANGUAGES AND PROGRAMMING | 1997年 / 1256卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we address min-max equations for periodic and non-periodic problems. In the non-periodic case a simple algorithm is presented to determine whether a graph has a potential satisfying the min-max equations. This method can also be used to solve a more general quasi periodic min-max problem on periodic graphs. Also some results regarding the uniqueness of solutions in the latter case are given.

引用

页码：379 / 389

页数：11

共 19 条

[1] Ahuja R.K., 1993, NETWORK FLOWS
[2] Baccelli F., 1992, SYNCHRONIZATION LINE
[3] BACKES W, 1992, 4 ANN ACM S PAR ALG, P333
[4] A LINEAR-SYSTEM-THEORETIC VIEW OF DISCRETE-EVENT PROCESSES AND ITS USE FOR PERFORMANCE EVALUATION IN MANUFACTURING
COHEN, G
DUBOIS, D
QUADRAT, JP
VIOT, M
[J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1985, 30 (03) : 210 - 220
[5] DESCRIBING INDUSTRIAL-PROCESSES WITH INTERFERENCE AND APPROXIMATING THEIR STEADY-STATE BEHAVIOR
CUNINGHAMEGREEN, RA
[J]. OPERATIONAL RESEARCH QUARTERLY, 1962, 13 (01) : 95 - 106
[6] Gunawardena J., 1993, TAU 93 ACM INT WORKS
[7] GUNAWARDENA J, 1994, IN PRESS DISCRETE EV
[8] KARP RM, 1978, DISCRETE MATH, V23, P309, DOI 10.1016/0012-365X(78)90011-0
[9] KOSARAJU SR, 1988, 20 ANN ACM S THEOR C, P398
[10] LAWLER EL, 1966, THEOR GRAPHS INT S, P209

← 1 2 →