Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

The Graph Partition Problem

그래프분할문제

  • Published : 2003.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we present a survey about the various graph partition problems including the clustering problem, the k-cut problem, the multiterminal cut problem, the multicut problem, the sparsest cut problem, the network attack problem, the network disconnection problem. We compare those problems focusing on the problem characteristics such as the objective function and the conditions that the partitioned clusters should satisfy. We also introduce the mathematical programming formulations, and the solution approaches developed for the problems.

Keywords

References

  1. 네트워크 단절문제에 대한 상한과 하한을구하는 해법 김현준;명영수;박성수;오상민
  2. 한국과학기술원 석사학위논문 네크워크 단절문제에 대한 수리모형과 휴리스틱 해법 오상민
  3. SIAM J. Computing v.27 Approximate Min-cut Max-clow Therem and Approximation Algorithm Aumann,Y.;Y.Rabani
  4. Operational Research Letters v.12 Separating from the Dominant of the Spanning Tree Polytope Barahona,F.
  5. Networks v.34 Analysis of LP Relaxations for Multiway and Muliticut Problems Bertsimas,D.;C.P.Teo;R.Vohra
  6. Proceedings of the 13th Symposium on Theory of Computing An Improved Approximation Algorithm for Multiway Cut Calinescu,G.;H.Karloff;Y.Rabani
  7. Mathematical Programming v.73 Extended Formulation for the A-cut Problem Chopra,S.;J.H.Owen
  8. Networks v.21 On the Multiway Cut Polyhedron Chopra,S.;M.R.Rao
  9. Mathematical Programming v.59 The Partition Problem Chopra,S.;M.R.Rao
  10. Discrete Mathematics v.5 Tough Graphs and Hamiltonian Circuits Chvatal,V.
  11. Mathematical Programming v.49 The Equipartition Polytope I : Formulations, Dimension, and Basic Facets Conforti;M.R.Rao;A.ssano
  12. Mathematical Programming v.49 The Equipartition Polytope II : Formulations, Valid Inequalities and Facets Conforti;M.R.Rao;A.ssano
  13. DIMACS series in Discrete Mathematics and Theoretical Computer Science v.5 The Optimal Multiterminal Cut Problem Cunningham,W.H.
  14. J. of ACM v.32 Optimal Attack and Reinforcement of a Network Cunningham,W.H.
  15. SIAM J. Computing v.23 The Complexity of Multiterminal Cuts Dalhaus,E.;D.Johnson;C.Papadimitriou;P.Seymour;M.Yannakakis
  16. Mathematics of Operations Research v.17 Clique Web Facets for Multicut Polytopes Deza,M.;M.Grotschel;M.Laurent
  17. Mathematical Programming v.66 A Computational Study of Graph Partitioning Falkner,J.;F.Rendl;H.Wolkowicz
  18. Mathematical Programming v.74 Formulation and Valid Inequalities for the Node Capacitated Graph Partitioning Problem Ferreira,C.E.;A.Martin;C.C.De Souza;R.Weismantel;L.A.Wolsey
  19. Mathematical Programming v.81 The Node Capacitated Graph Partitioning Problem : A Computational Study Ferreira,C.E.;A.Martin;C.C.De Souza;R.Weismantel;L.A.Wolsey
  20. SIAM J. Computing v.25 Approximate Max-flow Min-(multi)cut Theorems and their Applications Garg,N.;V.Vazirani;M.Yannakakis
  21. Mathematics of Operations Research v.19 A Polynomial Algorithm for The k Cut Problem for Fixed k Goldschmidt,O.;D.S.Hochbaum
  22. Mathematical Programming v.45 A Cutting Plane Algorithm for a Clustering Problem Grotschel,M.;Y.Wakabayashi
  23. Mathematical Programming v.47 Facets of the Clique Partitioning Polytope Grotschel,M.;Y.Wakabayashi
  24. Report No. 33, IRIA_Labora Graph Partitioning and Constructing Optimal Decision Trees are Polynomial Complete Problems Hyafil,L.;R.L.Rivest
  25. Mathematical Programming v.62 Min-cut Clustering Johnson,E.L.;A.Mehrotra;G.L.Nemhauser
  26. Bell Syst. Tech. J. v.49 An Efficient Heuristic Procedure for Partitioning Graphs Kernighan,B.W.;S.Lin
  27. Management Science v.40 Clustering for the Design of SONET Rings in Interoffice Telecommunications Laguna,M.
  28. Combinatorica v.15 The Geometry of Graphs And Some of its Algorithmic Applications Linial,N.;E.London;Y.Rabinovich
  29. Mathematical Programming B v.95 Graph Partitioning using Linear and Semidefinite Programming Lisser,A.;F.Rendl
  30. Working paper, UC Davis Computing the Disconnectivity of a Graph Martel,C.;G.Nuckolls;D.Sniegowski
  31. Discrete Applied Mathematics v.27 Sparsest cuts and Bottlenecks in graphs Matula,D.W.;F.Shahrokhi
  32. Working paper, Dankook University An Algorithm for the graph disconnection problem Myung,Y.S.;H.J.Kim
  33. Management Sciene v.46 Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements Park,K.;K.Lee;S.Park;H.Lee
  34. SIAM J. Computing v.24 Finding k Cuts within Twice the Optimal Saran,H.;V.Vazirani
  35. Journal of Operational Research Society v.48 Location-area Partition a Cellular Radio Network Tcha,D.W.;T.J.Choi;Y.S.Myung
  36. Resenhas IME-USP v.3 The Complexity of Computing Medians of Relations Wakabayashi,Y.