Multicriteria global minimum cuts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 65-76

  Armon, Amitai ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; GLOBAL OPTIMIZATION; POLYNOMIAL APPROXIMATION; SALES; UNDIRECTED GRAPHS; COSTS; OPTIMIZATION;

FIXED NUMBERS; GLOBAL MINIMUM; INPUT GRAPHS; MINIMUM CUT; MULTI-CRITERIA; MULTICRITERIA DECISION PROBLEM; NON NEGATIVES; NP-HARD; POLYNOMIAL-TIME; UNDIRECTED GRAPH; GLOBAL MINIMA; MULTI-CRITERIA DECISION PROBLEMS; OPTIMIZATION PROBLEMS;

COSTS; GLOBAL OPTIMIZATION;

EID: 35048867417     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_8     Document Type: Article

References (19)

1. M. Bruglieri, M. Ehrgott, and H.W. Harnacher. Some complexity results for k-cardinality minimum cut problems. Technical Report 69/2000, Wirtschaftsmathematik, University of Kaiserslautern, 2000.
2. M. Bruglieri, F. Maffioli, and M. Ehrgott. Cardinality constrained minimum cut problems: Complexity and algorithms. Discrete Applied Mathematics, 137(3):311-341, 2004.
3. J. Climacao. Multicriteria Analysis. Springer-Verlag, 1997.
4. M. Ehrgott. Multicriteria optimization. Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, 2000.
5. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
6. R.E. Gomory and T. C. Hu. Multiterminal network flows. Journal of the Society for Industrial and Applied Mathematics, 9(4):551-570, 1961.
7. P. Hansen. Bicriterion path problems. In G. Fandel and T. Gal, editors, Multiple Criteria Decision Making: Theory and Applications, LNEMS 177, pages 109-127. Springer-Verlag, Berlin, 1980.
8. S.P. Hong, S.J. Chung, and B.H. Park. A fully-polynomial bicriteria approximation scheme for the constrained minimum spanning tree problem. Operations Research Letters, 32(3):233-239, 2004.
9. E. Horowitz and S. Sahni. Exact and approximate algorithms for scheduling non-identical processors. Journal of the ACM, 23:317-327, 1976.
10. K. Jansen and L. Porkolab. Improved approximation schemes for scheduling unrelated parallel machines. In Proceedings of the thirty-first annual ACM Symposium on Theory of Computing, pages 408-417, 1999.
11. D. R. Karger. Random sampling in cut, flow, and network design problems. Mathematics of Operations Research, 24(2):383-413, 1999.
12. D. R. Karger. Minimum cuts in near-linear time. Journal of the ACM, 47(1):46-76, 2000.
13. D. R. Karger and C. Stein. A new approach to the minimum cut problem. Journal of the ACM, 43(4):601-640, 1996.
14. J.K. Lenstra, D.B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46:259-271, 1990.
15. H. Nagamochi and T. Ibaraki. Computing edge-connectivity in multigraphs and capacitated graphs. SIAM Journal on Discrete Mathematics, 5(1):54-66, 1992.
16. H. Nagamochi, K. Nishimura, and T. Ibaraki. Computing all small cuts in an undirected network. SIAM J. Discrete Mathematics, 10(3):469-481, 1997.
17. C. H. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access of web sources. In IEEE Symposium on Foundations of Computer Science, pages 86-92, 2000.
18. K. Schloegel, G. Karypis, and V. Kumar. A new algorithm for multi-objective graph partitioning. In European Conference on Parallel Processing, pages 322-331, 1999.
19. M. Stoer and F. Wagner. A simple min-cut algorithm. Journal of the ACM, 44(4):585-591, 1997.