{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T17:45:27Z","timestamp":1777657527711,"version":"3.51.4"},"reference-count":0,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"vor","delay-in-days":31,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["VLSI Design"],"published-print":{"date-parts":[[2000,1]]},"abstract":"<jats:p>In this paper, we present a new multilevel <jats:italic>k<\/jats:italic>\u2010way hypergraph partitioning algorithm that\nsubstantially outperforms the existing state\u2010of\u2010the\u2010art K\u2010PM\/LR algorithm for multi\u2010way\npartitioning, both for optimizing local as well as global objectives. Experiments on\nthe ISPD98 benchmark suite show that the partitionings produced by our scheme are on\nthe average 15% to 23% better than those produced by the K\u2010PM\/LR algorithm, both\nin terms of the hyperedge cut as well as the (<jats:italic>K<\/jats:italic> \u2013 1) metric. Furthermore, our algorithm\nis significantly faster, requiring 4 to 5 times less time than that required by K\u2010PM\/LR.<\/jats:p>","DOI":"10.1155\/2000\/19436","type":"journal-article","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T12:58:57Z","timestamp":1190120337000},"page":"285-300","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":135,"title":["Multilevel <i>k<\/i>\u2010way Hypergraph Partitioning"],"prefix":"10.1155","volume":"11","author":[{"given":"George","family":"Karypis","sequence":"first","affiliation":[]},{"given":"Vipin","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[1999,12]]},"container-title":["VLSI Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/archive\/2000\/019436.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/vlsi\/2000\/019436.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2000\/19436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T22:19:43Z","timestamp":1723069183000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2000\/19436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1155\/2000\/19436"],"URL":"https:\/\/doi.org\/10.1155\/2000\/19436","archive":["Portico"],"relation":{},"ISSN":["1065-514X","1563-5171"],"issn-type":[{"value":"1065-514X","type":"print"},{"value":"1563-5171","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,12]]},"assertion":[{"value":"1999-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"1999-12-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"1999-12-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}