{"id":"https://openalex.org/W2033954061","doi":"https://doi.org/10.1002/net.3230200205","title":"A class of bounded approximation algorithms for graph partitioning","display_name":"A class of bounded approximation algorithms for graph partitioning","publication_year":1990,"publication_date":"1990-03-01","ids":{"openalex":"https://openalex.org/W2033954061","doi":"https://doi.org/10.1002/net.3230200205","mag":"2033954061"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230200205","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200205","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056803976","display_name":"Thomas A. Feo","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Thomas A. Feo","raw_affiliation_strings":["Operations Research Group, Department of Mechanical Engineering, University of Texas, Austin, Texas 78712"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research Group, Department of Mechanical Engineering, University of Texas, Austin, Texas 78712","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024896262","display_name":"Mallek Khellaf","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mallek Khellaf","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720","Department of Industrial Engineering & Operations Research, University of California, Berkeley, California 94720"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Department of Industrial Engineering & Operations Research, University of California, Berkeley, California 94720","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056803976"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":3.3828,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.91545239,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"2","first_page":"181","last_page":"195"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7951359748840332},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6944496035575867},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5222336053848267},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5211424827575684},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.509472668170929},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5065447092056274},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4957748353481293},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46732962131500244},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4257075786590576},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41843047738075256},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4127943515777588},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38801640272140503}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7951359748840332},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6944496035575867},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5222336053848267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5211424827575684},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.509472668170929},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5065447092056274},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4957748353481293},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46732962131500244},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4257075786590576},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41843047738075256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4127943515777588},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38801640272140503},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230200205","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200205","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W190413104","https://openalex.org/W1482460657","https://openalex.org/W1513400187","https://openalex.org/W1560792291","https://openalex.org/W2003309297","https://openalex.org/W2011039300","https://openalex.org/W2024060531","https://openalex.org/W2030087828","https://openalex.org/W2035409768","https://openalex.org/W2039866888","https://openalex.org/W2053913299","https://openalex.org/W2056760934","https://openalex.org/W2147831803","https://openalex.org/W2161455936","https://openalex.org/W2620655995"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W2138685729","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2098284475","https://openalex.org/W1968154277"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"considers":[3],"the":[4,8,23,26,29,36,69,85],"problem":[5,80],"of":[6,10,18,25,28,43,84],"partitioning":[7],"nodes":[9],"a":[11,82],"weighted":[12],"graph":[13],"into":[14],"k":[15,61],"disjoint":[16],"subsets":[17],"bounded":[19],"size,":[20],"such":[21],"that":[22,68],"sum":[24],"weights":[27],"edges":[30],"whose":[31],"end":[32],"vertices":[33],"belong":[34],"to":[35,55,75],"same":[37],"subset":[38],"is":[39,49,62],"maximized.":[40],"A":[41],"class":[42],"approximation":[44],"algorithms":[45,52],"based":[46],"on":[47],"matching":[48],"presented.":[50],"These":[51],"are":[53],"shown":[54],"yield":[56],"practical":[57],"worst\u2010case":[58],"bounds":[59],"when":[60],"large.":[63],"Extensive":[64],"empirical":[65],"experimentation":[66],"indicates":[67],"methods":[70],"produce":[71],"consistently":[72],"good":[73],"solutions":[74],"an":[76],"important":[77],"VLSI":[78],"design":[79],"in":[81],"fraction":[83],"time":[86],"required":[87],"by":[88],"competing":[89],"methods.":[90]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}