{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:13:42Z","timestamp":1729653222700,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1109\/paap.2010.23","type":"proceedings-article","created":{"date-parts":[[2011,2,18]],"date-time":"2011-02-18T18:23:55Z","timestamp":1298053435000},"page":"395-397","source":"Crossref","is-referenced-by-count":0,"title":["The Complement of Hypergraph Capacitated Min-k-Cut Problem"],"prefix":"10.1109","author":[{"family":"Wenxing Zhu","sequence":"first","affiliation":[]},{"family":"Jiarui Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70760"},{"key":"ref11","first-page":"2","article-title":"multilevel hypergraph partitioning","author":"karypis","year":"2002","journal-title":"Technical Report"},{"key":"ref12","first-page":"61","article-title":"Hypergraph Partitioning and Clustering","author":"david","year":"2007","journal-title":"Approximation Algorithms and Metaheuristics"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792251730"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374415"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/050640904","article-title":"A Polylogarithmic Approximation of the Minimum Bisection","volume":"48","author":"feige","year":"2006","journal-title":"SIAM Review"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1350-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827593255135"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796308217"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2004.08.028"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.892339"},{"key":"ref6","first-page":"419","author":"ducournau","year":"0","journal-title":"Proc 2009 IEEE International Conference on Signal and Image Processing Applications (ICSIPA)"},{"key":"ref5","first-page":"133","article-title":"Partitioning large networks without breaking communities","volume":"52","author":"narasimhamurthy","year":"2005","journal-title":"Knowl Inf Syst"},{"key":"ref8","first-page":"175","author":"fiduccia","year":"0","journal-title":"Proc 19th IEEE Design Automation Conference"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1201\/9781420013481-7","author":"kucar","year":"2008","journal-title":"Handbook of Algorithm for Physical Design Automation"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/B:HEUR.0000019985.94952.eb","article-title":"Lock-Gain Based Graph Partitioning","volume":"10","author":"kim","year":"2004","journal-title":"Journal of Heuristics"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.102"},{"article-title":"A semidefinite programming approach to the hypergraph minimum bisection problem","year":"2010","author":"choi","key":"ref22"},{"key":"ref21","article-title":"Appraximability of hypergraph minimum bisection","author":"berman","year":"2003","journal-title":"Technical report RAND-APX Thematic Network"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0139-z"}],"event":{"name":"Third International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2010)","start":{"date-parts":[[2010,12,18]]},"location":"Dalian","end":{"date-parts":[[2010,12,20]]}},"container-title":["2010 3rd International Symposium on Parallel Architectures, Algorithms and Programming"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5714188\/5715054\/05715114.pdf?arnumber=5715114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,16]],"date-time":"2020-06-16T18:18:21Z","timestamp":1592331501000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5715114\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/paap.2010.23","relation":{},"subject":[],"published":{"date-parts":[[2010,12]]}}}