Improving graph partitions using submodular functions

Discrete Applied Mathematics

Volumn 131, Issue 2, 2003, Pages 535-553

  Patkar, Sachin B ^a   Narayanan, H ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTIONS; HEURISTIC METHODS; INTEGRATED CIRCUIT LAYOUT; POLYNOMIALS; VLSI CIRCUITS;

SUBMODULAR FUNCTIONS;

GRAPH THEORY;

EID: 0041328205     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00472-9     Document Type: Conference Paper

References (20)

1. Alpert C.J., Kahng A.B., Yao S.Z. Spectral Partitioning with multiple eigenvectors. Discrete Appl. Math. 90:1999;3-26.
2. C.J. Alpert, S.Z. Yao, Spectral partitioning: the more eigenvectors, the better, Proceedings of 32nd Design Automation Conference, 1995, pp. 195-200.
3. Asahiro Y., Iwama K., Tamaki H. Greedily finding a dense subgraph. J. Algorithms. 34:2000;203-221.
4. Cheng E., Cunningham W. A faster algorithm for computing the strength of a network. Inform. Process. Lett. 49:1994;209-212.
5. Dinkelbach W. On nonlinear fractional programming. Manage. Sci. 13:1967;492-498.
6. J. Edmonds, Submodular functions, matroids and certain polyhedra, Proceedings of the Calgary International Conference on Combinatorial Structures, 1970, pp. 69-87.
7. U. Feige, G. Kortsarz, D. Peleg, The densest k -subgraph problem, Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993, pp. 692-701.
8. Fujishige S. Submodular Functions and Optimization, Annals of Discrete Mathematics. 1991;North-Holland, Amsterdam.
9. Gabow H.N. Algorithms for graphic polymatroids and parametric s-sets. J. Algorithms. 26:1998;48-86.
10. Gallo G., Grigoriadis M., Tarjan R.E. A fast parametric network flow algorithm. SIAM J. Comput. 18:1989;30-55.
11. Goldberg A.V., Tarjan R.E. A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35:1988;921-940.
12. O. Goldschmidt, D. Hochbaum, Polynomial algorithm for the k -cut problem, 29th Annual Symposium on Foundations of Computer Science, 1988, pp. 444-451.
13. Gusfield D. Computing the strength of a graph. SIAM J. Comput. 20:1991;639-654.
14. F.T. Leighton, S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximate algorithms, 29th Annual Symposium on Foundations of Computer Science, 1988, pp. 422-431.
15. Lengauer T. Combinatorial Algorithms for Integrated Circuit Layout. 1990;Bryan Press, New York.
16. Narayanan H. Submodular Functions and Electrical Networks. Annals of Discrete Mathematics. Vol. 54:1997;North-Holland, Amsterdam.
17. Narayanan H., Roy S., Patkar S.B. Approximation algorithms for min-. k -overlap problems, using the principal lattice of partitions approach J. Algorithms. 21:1996;306-330.
18. S.B. Patkar, H. Narayanan, Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition, Proceedings of 20th Annual Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 1974, Springer, Berlin, 2000, pp. 94-105.
19. Picard J.C., Queyeranne M. Selected applications of minimum cuts in networks. INFOR-Canada J. Oper. Res. Inform. Process. 20:1982;394-422.
20. N. Tomizawa, S. Fujishige, Historical survey of extensions of the concept of principal partition and their unifying generalization to hypermatriods, Systems Science Research Report No. 5, Department of Systems Science, Tokyo Institute of Technology, April 1982 (also its abridgment in Proceedings of the 1982 IEEE International Symposium on Circuits and Systems Rome, 1982, pp. 142-145).