Multicriteria global minimum cuts

Algorithmica (New York)

Volumn 46, Issue 1, 2006, Pages 15-26

  Armon, Amitai ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Graph algorithms; Minimum cut; Multicriteria optimization

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; DECISION MAKING; OPTIMIZATION; PROBLEM SOLVING;

GRAPH ALGORITHMS; MINIMUM CUT; MULTICRITERIA OPTIMIZATION; PSEUDO-POLYNOMIAL;

GRAPH THEORY;

EID: 33747894607     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0068-x     Document Type: Conference Paper

References (20)

1. M. Bruglieri, M. Ehrgott, and H. W. Hamacher. Some complexity results for k-cardinality minimum cut problems. Technical Report 69/2000, Wirtschaftsmathematik, University of Kaiserslautern, 2000.
2. M. Bruglieri, F. Maffloli, 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, New York, 1997.
4. M. Ehrgott. Multicriteria Optimization. Lecture Notes in Economics and Mathematical Systems, 491. Springer-Verlag, New York, 2000.
5. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 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, pages 109-127. Lecture Notes in Economics and Mathematical Systems, 177. Springer-Verlag, New York, 1980.
8. R. Hassin and A. Levin. An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM Journal on Computing, 33(2):261-268, 2004.
9. 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.
10. E. Horowitz and S. Sahni. Exact and approximate algorithms for scheduling non-identical processors. Journal of the ACM, 23:317-327, 1976.
11. 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.
12. D.R. Karger. Random sampling in cut, flow, and network design problems. Mathematics of Operations Research, 24(2):383-413, 1999.
13. D. R. Karger. Minimum cuts in near-linear time. Journal of the ACM, 47(1):46-76, 2000.
14. D. R. Karger and C. Stein. A new approach to the minimum cut problem. Journal of the ACM, 43(4):601-640, 1996.
15. J. K. Lenstra, D. B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46:259-271, 1990.
16. H. Nagamochi and T. Ibaraki. Computing edge-connectivity in multigraphs and capacitated graphs. SIAM Journal on Discrete Mathematics, 5(1):54-66, 1992.
17. H. Nagamochi, K. Nishimura, and T. Ibaraki. Computing all small cuts in an undirected network. SIAM Journal on Discrete Mathematics, 10(3):469-481, 1997.
18. C. H. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access of web sources. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 86-92, 2000.
19. K. Schloegel, G. Karypis, and V. Kumar. A new algorithm for multi-objective graph partitioning. In Proceedings of the European Conference on Parallel Processing, pages 322-331, 1999.
20. M. Stoer and F. Wagner. A simple min-cut algorithm. Journal of the ACM, 44(4):585-591, 1997.