{"id":"https://openalex.org/W1977360022","doi":"https://doi.org/10.1137/s0097539796308217","title":"Fast Approximate Graph Partitioning Algorithms","display_name":"Fast Approximate Graph Partitioning Algorithms","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1977360022","doi":"https://doi.org/10.1137/s0097539796308217","mag":"1977360022"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796308217","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796308217","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5064059676","display_name":"Guy Even","orcid":"https://orcid.org/0000-0001-5407-330X"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy Even","raw_affiliation_strings":["IBM, ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM, ,","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103783564","display_name":"Satish Rao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Satish Rao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6622,"has_fulltext":false,"cited_by_count":117,"citation_normalized_percentile":{"value":0.9461049,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"28","issue":"6","first_page":"2187","last_page":"2214"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.9997000098228455,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6710606217384338},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.670339822769165},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6133365035057068},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5693787336349487},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4620913863182068},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.45974618196487427},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4459479749202728},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4414585530757904},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.43666332960128784},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42964881658554077},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4233202040195465},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39827021956443787},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3845407962799072}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6710606217384338},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.670339822769165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6133365035057068},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5693787336349487},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4620913863182068},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.45974618196487427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4459479749202728},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4414585530757904},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.43666332960128784},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42964881658554077},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4233202040195465},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39827021956443787},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3845407962799072},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539796308217","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796308217","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1632601927","https://openalex.org/W1971316057","https://openalex.org/W1971758446","https://openalex.org/W2002272911","https://openalex.org/W2011039300","https://openalex.org/W2024778356","https://openalex.org/W2044343300","https://openalex.org/W2070745908","https://openalex.org/W2084224084","https://openalex.org/W2091004914","https://openalex.org/W2121902703","https://openalex.org/W2123707909","https://openalex.org/W2125278290","https://openalex.org/W2128193809","https://openalex.org/W2134422938","https://openalex.org/W2151334846","https://openalex.org/W2161455936","https://openalex.org/W4242767541"],"related_works":["https://openalex.org/W4235911878","https://openalex.org/W3190829980","https://openalex.org/W2129497110","https://openalex.org/W1995738188","https://openalex.org/W2115772827","https://openalex.org/W115807216","https://openalex.org/W2088200711","https://openalex.org/W2005944337","https://openalex.org/W4289685524","https://openalex.org/W1968512104"],"abstract_inverted_index":{"We":[0,68,122,163,193,206],"study":[1],"graph":[2],"partitioning":[3],"problems":[4,14],"on":[5,84,142],"graphs":[6,115,199],"with":[7,208],"edge":[8],"capacities":[9],"and":[10,18,72,96],"vertex":[11,42,53],"weights.":[12],"The":[13,138],"of":[15,36,51,65,119,129,183,190,202],"b-balanced":[16,94,227],"cuts":[17,95,228],"k-balanced":[19,97,111],"partitions":[20,40,112],"are":[21],"unified":[22],"into":[23,44],"a":[24,34,70,117,127,143,166,179,187],"new":[25,71],"problem":[26,158],"called":[27,145,168],"minimum":[28,78,155,180],"capacity":[29,79,156,181],"$\\rho$-separators.":[30,219],"A":[31],"$\\rho$-separator":[32,157],"is":[33,58,82,140,176],"subset":[35,182],"edges":[37,184],"whose":[38],"removal":[39],"the":[41,49,52,63,66,104,130,154,169,174],"set":[43],"connected":[45],"components":[46],"such":[47],"that":[48,132,148,185],"sum":[50],"weights":[54],"in":[55,113],"each":[56],"component":[57],"at":[59],"most":[60],"$\\rho$":[61],"times":[62],"weight":[64],"graph.":[67],"present":[69],"simple":[73],"O(log":[74,89,120,135],"n)-approximation":[75,90],"algorithm":[76,91,131,139,211],"for":[77,93,110,200,212,218,225],"$\\rho$-separators":[80],"which":[81],"based":[83,141],"spreading":[85,146,216],"metrics":[86,147],"yielding":[87],"an":[88,134,160,209,214],"both":[92],"partitions.":[98],"In":[99],"particular,":[100],"this":[101],"result":[102],"improves":[103],"previous":[105],"best":[106],"known":[107],"approximation":[108],"factor":[109,118],"undirected":[114],"by":[116,125],"k).":[121],"enhancethese":[123],"results":[124,196],"presenting":[126],"version":[128],"obtains":[133],"OPT)-approximation":[136],"factor.":[137],"technique":[144],"enables":[149],"us":[150],"to":[151,177,197],"formulate":[152],"directly":[153],"as":[159],"integer":[161],"program.":[162],"also":[164],"introduce":[165],"generalization":[167],"simultaneous":[170],"separator":[171],"problem,":[172],"where":[173],"goal":[175],"find":[178],"separates":[186],"given":[188],"collection":[189],"subsets":[191],"simultaneously.":[192],"extend":[194],"our":[195],"directed":[198],"values":[201],"$\\rho":[203],"\\geq":[204],"1/2$.":[205],"conclude":[207],"efficient":[210,223],"computing":[213,226],"optimal":[215],"metric":[217],"This":[220],"yields":[221],"more":[222],"algorithms":[224],"than":[229],"were":[230],"previously":[231],"known.":[232]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":8}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}