The complement of hypergraph capacitated min-k-cut problem

Proceedings - 3rd International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2010

Volumn , Issue , 2010, Pages 395-397

  Zhu, Wenxing ^a   Chen, Jiarui ^a  

^a FUZHOU UNIVERSITY   (China)

Author keywords

Approximation algorithm; Capacitated min k cut; Hypergraph partitioning

Indexed keywords

APPROXIMATE RESULTS; APPROXIMATION FACTOR; CAPACITATED MIN-K-CUT; CARDINALITIES; HYPEREDGES; HYPERGRAPH; HYPERGRAPH PARTITIONING; LOCAL SEARCH ALGORITHM; MAX-K-CUT PROBLEM; NP-HARD PROBLEM; VLSI CAD;

COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; IMAGE SEGMENTATION; PARALLEL ARCHITECTURES; PARALLEL PROGRAMMING;

APPROXIMATION ALGORITHMS;

EID: 79952569435     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PAAP.2010.23     Document Type: Conference Paper

References (23)

1. M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NPcomplete graph problems, Theoret. Comput. Sci.,1(3), pp. 237-267, 1976.
2. D. kucar, Handbook of Algorithms for Phsical Design Automation, CRC Press, pp.109-134, 2008.
3. J. Li, L. Behjat, Net Cluster: A Net-Reduction-Based clustering preprocessing algorithm for partitioning and placement, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 26(4), pp.669-679, 2007. (Pubitemid 46479741)
4. K. D. Devine, E. G. Boman, R. T. Heaphy, et al., New challenges in dynamic load balancing, Appl. Numer. Math., 52(2), pp.133-152, 2005.
5. A. Narasimhamurthy, D. Greene, N. Hurley, et al., Partitioning large networks without breaking communities, Knowl. Inf. Syst., 52(2), pp.133-152, 2005.
6. A. Ducournau, S. Rital, A. Bretto, A multilevel spectral hypergraph partitioning approach for color image segmentation, in Proc. 2009 IEEE International Conference on Signal and Image Processing Applications (ICSIPA), pp.419-424, 2009
7. B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, The Bell System Technical Journal, 49(2), pp.291-307, 1970.
8. C. M. Fiduccia and R. M. Mattheyses, A linear time heuristic for improving network partitions, In Proc. 19th IEEE Design Automation Conference, pp.175-181, 1982.
9. Y. H. Kim and B. R. Moon, Lock-Gain Based Graph Partitioning, Journal of Heuristics,10(1), pp.37-57, 2004.
10. P. Chardaire, M. Barake, and G. P. McKeown, A PROBE-Based Heuristic for Graph Partitioning, IEEE Tansactions on Computers, 56(12), pp.1707-1720, 2007. (Pubitemid 350141889)
11. G. Karypis, multilevel hypergraph partitioning, Technical Report 02-025, University of Minnesota, 2002.
12. David A. Papa, Igor L. Markov, Hypergraph Partitioning and Clustering, In Approximation Algorithms and Metaheuristics, pp. 61-1 through 61-19, 2007.
13. H. Saran and V. V. Vazirani, Finding k-cuts within twice the optimal, SIAM Journal on Computing, 24(1), pp.101-108,1995.
14. Y. Boykov, O. Veksler, and R. Zabih, A Fast approximate energy minimization via graph cuts, IEEE Trans. Pattern Anal.Mach.Intell., 23(11), pp.1222-1239, 2001. (Pubitemid 33137959)
15. H. Räcke, Optimal hierarchical decompositions for congestion minimization in networks, In Proc. 40th annual ACM symposium on Theory of computing, pp.255-264, 2008.
16. U. Feige, R. Krauthgamer, A Polylogarithmic Approximation of the Minimum Bisection, SIAM Review, 48(1), pp.99-130, 2006.
17. K. Andreevand H. Räcke, Balanced graph partitioning, Theory Comput. Syst., 39(6), pp.929-939, 2006. (Pubitemid 44878432)
18. H. D. Simon and S. Teng, How good is recursive bisection?, SIAM J. Sci. Comput., 18(5), pp.1436-1445, 1997. (Pubitemid 127642160)
19. G. Even, J. Naor, S. Rao, et al., Fast approximate graph partitioning algorithms, SIAM J. Comput., 28(6), pp.2187-2214, 1999. (Pubitemid 30530997)
20. R. Krauthgamer, J. S. Naory, and R. Schwartzz, Partitioning graphs into balanced components, In Proc. of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.942-949, 2009.
21. P. Berman and M. Karpinski., Approximability of hypergraph minimum bisection, Technical report, RAND-APX Thematic Network, 2003.
22. P. Choi and S. Burer, A semidefinite programming approach to the hypergraph minimum bisection problem, 2010.
23. D. R. Gaur, R. Krishnamurti, and R. Kohli, The capacitated max k-cut problem, Mathematical Programming, 115(1), pp.65-72, 2008. (Pubitemid 351702152)