{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:15:11Z","timestamp":1778127311989,"version":"3.51.4"},"reference-count":23,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6068,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1990,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper considers the problem of partitioning the nodes of a weighted graph into <jats:italic>k<\/jats:italic> disjoint subsets of bounded size, such that the sum of the weights of the edges whose end vertices belong to the same subset is maximized. A class of approximation algorithms based on matching is presented. These algorithms are shown to yield practical worst\u2010case bounds when <jats:italic>k<\/jats:italic> is large. Extensive empirical experimentation indicates that the methods produce consistently good solutions to an important VLSI design problem in a fraction of the time required by competing methods.<\/jats:p>","DOI":"10.1002\/net.3230200205","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T08:49:41Z","timestamp":1178959781000},"page":"181-195","source":"Crossref","is-referenced-by-count":61,"title":["A class of bounded approximation algorithms for graph partitioning"],"prefix":"10.1002","volume":"20","author":[{"given":"Thomas A.","family":"Feo","sequence":"first","affiliation":[]},{"given":"Mallek","family":"Khellaf","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"65","article-title":"Two greedy heuristics for the weighted matching problem","author":"Avis D.","year":"1978","journal-title":"Congr. Numer."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0603056"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-51576-7"},{"key":"e_1_2_1_5_2","volume-title":"An Introduction to Automated Process Planning Systems","author":"Chang T. C.","year":"1985"},{"key":"e_1_2_1_6_2","unstructured":"C. C.Chen Placement and partitioning methods for integrated circuit layout. Ph. D. Dissertation Dept. of EECS University of California Berkeley CA (1986)."},{"key":"e_1_2_1_7_2","unstructured":"W.Dai andE.Kuh Simultaneous floor planning and global routing for hierarchical building block layout. IEEE Trans. Comput. Aided Design ICs Syst. (1987)."},{"key":"e_1_2_1_8_2","unstructured":"T. A.FeoandM.Khellaf The complexity of graph partitioning. Manuscript Operations Research Group Department of Mechanical Engineering University of Texas at Austin (1988)."},{"key":"e_1_2_1_9_2","unstructured":"L. R.FordandD. R.Fulkerson Maximal flow through a network. Rand Research Memorandum RM\u20101400 (Nov. 1954)."},{"key":"e_1_2_1_10_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"e_1_2_1_12_2","unstructured":"O.Goldschmidt M.Khellaf andT. A.Feo Private communication (1988)."},{"key":"e_1_2_1_13_2","volume-title":"A simple adaptive heuristic applied to K\u2010way partitioning and building block placement. Manuscript","author":"Jackson M.","year":"1986"},{"key":"e_1_2_1_14_2","volume-title":"The complexity of multiway cuts. Manuscript","author":"Johnson D. S.","year":"1984"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_2_1_16_2","unstructured":"M.Khellaf On the partitioning of graphs and hypergraphs. Ph. D. Dissertation Dept. IEOR University of California Berkeley (1987)."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207548208947754"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_2_1_19_2","unstructured":"J.Kral To the problem of segmentation of a program.Info. Process. Machines(1965)."},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(86)90032-9"},{"key":"e_1_2_1_21_2","volume-title":"On partitioning a graph: A heuristical and empirical study. Memorandum No. UCB\/ERL M78\/14, Electronics Research Laboratory","author":"MacGregor R. M.","year":"1978"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"e_1_2_1_23_2","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou C. H.","year":"1982"},{"key":"e_1_2_1_24_2","doi-asserted-by":"crossref","unstructured":"R. E.Tarjan Data Structures and Network Algorithms. CNMS\u2010NSF Regional Conference Series in Applied Math. (1983).","DOI":"10.1137\/1.9781611970265"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230200205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230200205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T07:25:17Z","timestamp":1697959517000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230200205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["10.1002\/net.3230200205"],"URL":"https:\/\/doi.org\/10.1002\/net.3230200205","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}