A strongly polynomial time algorithm for multicriteria global minimum cuts

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

Volumn 8494 LNCS, Issue , 2014, Pages 25-36

  Aissi, Hassene ^a   Mahjoub, A Ridha ^a   McCormick, S Thomas ^b   Queyranne, Maurice ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COST FUNCTIONS; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION;

ARBITRARY COSTS; BICRITERIA PROBLEMS; CONVEX COMBINATIONS; LINEAR SEGMENTS; NON-DOMINATED POINTS; PARAMETRIC CURVE; PSEUDO-POLYNOMIAL TIME ALGORITHMS; STRONGLY POLYNOMIAL TIME ALGORITHM;

PROBLEM SOLVING;

EID: 84958534049     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-07557-0_3     Document Type: Conference Paper

References (19)

1. Armon, A., Zwick, U.: Multicriteria global minimum cuts. Algorithmica 46(1), 15-26 (2006)
2. Carstensen, P.: Complexity of some parametric integer and network programming problems. Mathematical Programming 26, 64-75 (1983)
3. Ehrgott, M.: Multicriteria Optimization. Springer (2005)
4. Henzinger, M., Williamson, D. P.: On the number of small cuts in a graph. Information Processing Letters 59(1), 41-44 (1996)
5. Ihler, E., Wagner, D., Wagner, F.: Modeling hypergraphs by graphs with the same mincut properties. Information Processing Letters 45(4), 171-175 (1993)
6. Karger, D. R.: Global min-cuts in RNC, and other ramifications of a simple mincut algorithm. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 21-30 (1993)
7. Karger, D. R.: Minimum cuts in near-linear time. Journal of the ACM 47(1), 46-76 (2000)
8. Karger, D. R., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM 43(4), 601-640 (1996)
9. Klimmek, R., Wagner, F.: A simple hypergraph min cut algorithm. Freie Univ., Fachbereich Mathematik (1996)
10. McCormick, S. T., Ervolina, T. R.: Computing maximum mean cuts. Discrete Applied Math 52, 53-70 (1994)
11. Mulmuley, K.: Lower bounds in a parallel model without bit operations. SIAM Journal on Computing 28(4), 1460-1509 (1999)
12. Mak, W. K., Wong, D. F.: A fast hypergraph min-cut algorithm for circuit partitioning. Integration, the VLSI Journal 30(1), 1-11 (2000)
13. Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM Journal on Discrete Mathematics 5(1), 54-66 (1992)
14. Nagamochi, H., Ibaraki, T.: Algorithmic aspects of graph connectivity. Cambridge University Press (2008)
15. 2 log n) time and O (m) space. Inst. Electron. Inform. Comm. Eng. Trans. Inform. Systems, 179-185 (2003)
16. Nagamochi, H., Nishimura, K., Ibaraki, T.: Computing all small cuts in undirected networks. SIAM Journal of Discrete Mathematics 10, 469-481 (1997)
17. Queyranne, M.: Minimizing symmetric submodular functions. Mathematical Programming 82(1-2), 3-12 (1998)
18. Radzik, T.: Newton's Method for Fractional Combinatorial Optimization. In: Proceedings of IEEE Annual Symp. of Foundations of Computer Science, pp. 659-669 (1992)
19. Stoer, M., Wagner, F.: A simple min-cut algorithm. Journal of the ACM 44(4), 585-591 (1997)