Approximation algorithms for multi-parameter graph optimization problems

Discrete Applied Mathematics

Volumn 119, Issue 1-2, 2002, Pages 129-138

  Basov, Ivan ^a   Vainshtein, Alek ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Approximation algorithms; Graph algorithms; Multi parameter problems; Performance guarantee

Indexed keywords

EID: 84867948420     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00269-4     Document Type: Article

References (18)

1. V. Aggarwal, Y. Aneja, and K. Nair Minimal spanning tree subject to a side constraint Comput. Oper. Res. 9 1982 287 296 (Pubitemid 13476807)
2. D. Blokh, and G. Gutin An approximate algorithm for combinatorial optimization problems with two parameters Austral. J. Combin. 14 1996 157 164 (Pubitemid 126132865)
3. W. Cook, W. Cunningham, W. Pulleyblank, and A. Schrijver Combinatorial Optimization 1998 Wiley New York
4. J. Ganley, M. Golin, J. Salowe, The multi-weighted spanning tree problem, in: Computing and Combinatorics, Xi’an, Lecture Notes in Computer Science, Vol. 959, Springer, Berlin, 1995, pp. 141-150.
5. M. Garey, and D. Johnson Computers and Intractability: A Guide to the Theory of NP Completeness 1979 Freeman San Francisco, CA
6. G. Handler, and I. Zang A dual algorithm for the constrained shortest path problem Networks 10 1980 293 310
7. R. Hassin Approximation schemes for the restricted shortest path problem Math. Oper. Res. 17 1992 36 42
8. R. Hassin, and A. Tamir Maximizing classes of two-parameter objectives over matroids Math. Oper. Res. 14 1989 362 375
9. J. Jaffe Algorithms for finding paths with multiple constraints Networks 14 1984 96 116
10. H. Joksch The shortest route problem with constraints J. Math. Anal. Appl. 14 1966 191 197
11. M. Marathe, R. Ravi, R. Sundaram, S. Ravi, D. Rosenkrantz, and H. Hunt Bicriteria network design problems J. Algorithms 28 1998 142 171 (Pubitemid 128638752)
12. J.S.B. Mitchell Shortest paths and networks J. Goodman, J. O’Rourke, Handbook of Discrete and Computational Geometry 1997 CRC Press Boca Raton, FL 445 466
13. C. Phillips, The network inhibition problem, Proceedings of the 25th ACM Symposium on Theory of Computation, San Diego, CA, 1993, pp. 776-785.
14. S. Ravi, M. Goemans, The constrained minimum spanning tree problem, in: Proceedings of the Fifth Scandinavian Workshop in Algorithm Theory, eds., R. Karlsson and A. Lingas, Reykjavik, 1996, Lecture Notes in Computer Science, Vol. 1097, 1996, pp. 66-75. (Pubitemid 126091918)
15. ∞-norm, Ekonom. i Mat. Metody 21 (1985) 1032-1037 (English translation in: A.K. Kelmans (Ed.), Selected Topics in Discrete Mathematics, AMS, Providence, RI, 1994, pp. 207-216).
16. p-norm, in: Simulation and Optimization of Complex Systems, ed., G. Fridman, Omsk University Press, Omsk, 1987, 138-144.
17. A. Vainshtein, The vector shortest path problem and other vector optimization problems on graphs, Proceedings of the 17th Yugoslavian Symposium on Operation Research, Belgrade, 1990, pp. 169-172.
18. A. Warburton Approximation of Pareto optima in multiple-objective shortest path problems Oper. Res. 35 1987 70 79 (Pubitemid 17620345)