Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach

  • H. Narayanan
  • Subir Roy
  • Sachin Patkar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 841)


In this paper we have shown the utility of the Principal Lattice of Partitions approach to the construction of approximate algorithms for the Min-k-overlap problem. In particular we give an improved performance guarantee in the case of the Min-k-cut problem. An important open problem in this direction is to examine if the PLP can be used to handle the general balanced partition case. A restricted version of this problem is treated in the Appendix.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ford, L. R. & Fulkerson, D. R.: Flows in Networks, Princeton University Press, Princeton, 1962.Google Scholar
  2. 2.
    Goldschmidt, O. and Hochbaum, D.S.: Polynomial algorithm for the k-cut problem, Proc. 29 th annual Symp. on the Foundations of Computer Science, 1988,pp. 444–451.Google Scholar
  3. 3.
    Imai, H.: Network flow algorithms for lower truncated transversal polymatroids, Jl. of the Op. Research Society of Japan, vol. 26, 1983, pp. 186–210.Google Scholar
  4. 4.
    Iri, M. and Fujishige, S.: Use of matroid theory in operations research, circuits and systems theory, Int. J. Systems Sci., vol. 12, no. 1, 1981, pp. 27–54.Google Scholar
  5. 5.
    Kozen, D.C.: The Design and Analysis of Algorithms, Springer-Verlag, New York, 1992.Google Scholar
  6. 6.
    Lawler, E. L.: Combinatorial Optimization: Networks and Matroids, Holt, Reinhart and Winston, New York, 1976.Google Scholar
  7. 7.
    Lovasz, L.: Submodular Functions and Convexity, Proceedings of XI International Symposium on Mathematical Programming, Bonn, 1982.Google Scholar
  8. 8.
    Malhotra, V.M., Kumar, M.P., & Maheshwari, S.N.: An O (¦V¦3) Algorithm for Finding Maximum Flows in Networks, Information Processing Letters, 7, no.6, 1978, pp. 277–278.Google Scholar
  9. 9.
    Narayanan, H.: Theory of Matroids and Network Analysis, Ph.D. thesis, Department of Electrical Engineering, I.I.T. Bombay, 1974.Google Scholar
  10. 10.
    Narayanan, H.: On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis, Intl. Journal of Circuit Theory and Applications, Vol. 18, 1990, pp. 269–288.Google Scholar
  11. 11.
    Narayanan, H.: The Principal Lattice of Partitions of a Submodular Function, Linear Algebra and its Applications, 144, 1991,pp. 179–216.Google Scholar
  12. 12.
    Narayanan, H., Roy, Subir, & Patkar, Sachin: Min k-Cut and the Principal Partition of a Graph, Proceedings of the Second National Seminar on Theoretical Computer Science, Indian Statistical Institute, Calcutta, June 17–19, 1992.Google Scholar
  13. 13.
    Patkar, S. and Narayanan, H.: Fast algorithm for the Principal Partition of a graph, Proc. 11th Annual Symposium on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science560, 1991, pp. 288–306.Google Scholar
  14. 14.
    Patkar, S. and Narayanan, H.: Principal Lattice of Partitions of submodular functions on graphs: Fast algorithms for Principal Partition and Generic Rigidity, in Proc. of the 3 rd ann. Int. Symp. on Algorithms and Computation, (ISAAC), Lecture Notes in Computer Science-650, Japan, 1992, pp. 41–50.Google Scholar
  15. 15.
    Saran, H. and Vazirani, V.V.: Finding a k-Cut within Twice the Optimal, Proc. 32 nd annual Symp. on the Foundations of Computer Science, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • H. Narayanan
    • 1
  • Subir Roy
    • 2
  • Sachin Patkar
    • 3
  1. 1.Deptt. of Elec. Engg.IITBombayIndia
  2. 2.Deptt. of Elec. Engg.IITKanpurIndia
  3. 3.Forschungsinstitut für Diskrete MathematikUniversität BonnGermany

Personalised recommendations