Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach

Journal of Algorithms

Volumn 21, Issue 2, 1996, Pages 306-330

  Narayanan, H ^a   Roy, Subir ^a   Patkar, Sachin ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPH; HYPERGRAPH; NP HARD PROBLEM; PARTITION;

ALGORITHMS;

EID: 0030365332     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0047     Document Type: Article

References (10)

1. O. Goldschmidt and D. S. Hochbaum, Polynomial algorithm for the k-cut problem, in "Proceedings 29th Annual Symposium on the Foundations of Computer Science," pp. 444-451, 1988.
2. H. Imai, Network flow algorithms for lower truncated transversal polymatroids, J. Oper. Res. Soc. Japan 26 (1983), 186-210.
3. M. Iri and S. Fujishige, Use of matroid theory in operations research, circuits and systems theory, Int. J. Systems Sci. 12 (1981), 27-54.
4. E. L. Lawler, "Combinatorial Optimization: Networks and Matroids," Holt, Reinhart and Winston, New York, 1976.
5. L. Lovasz, Submodular Functions and Convexity, in "Proceedings of XI International Symposium on Mathematical Programming, Bonn, 1982."
6. H. Narayanan, On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis, Int. J. Circuit Theory Appl. 18 (1990), 269-288.
7. H. Narayanan, The principal lattice of partitions of a submodular function, Linear Algebra Appl. 144 (1991), 179-216.
8. H. Narayanan, S. Roy, and S. Patkar, Min k-Cut and the principal partition of a graph, in "Proceedings of the Second National Seminar on Theoretical Computer Science, Indian Statistical Institute, Calcutta, June 17-19, 1992."
9. S. Patkar and H. Narayanan, Principal lattice of partitions of submodular functions on graph: Fast algorithms for principal partition and generic rigidity, in "Proceedings of the Third International Symposium on Algorithms and Computations, Nagoya, Japan, Dec. 16-18, 1992."
10. H. Saran and V. V. Vazirani, Finding a k-cut within twice the optimal, in "Proceedings 32nd Annual Symposium on the Foundations of Computer Science, 1991."