{"id":"https://openalex.org/W2018419361","doi":"https://doi.org/10.1145/2746539.2746564","title":"A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection","display_name":"A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection","publication_year":2015,"publication_date":"2015-06-03","ids":{"openalex":"https://openalex.org/W2018419361","doi":"https://doi.org/10.1145/2746539.2746564","mag":"2018419361"},"language":"en","primary_location":{"id":"doi:10.1145/2746539.2746564","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746564","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5013518909","display_name":"Kyle Fox","orcid":"https://orcid.org/0000-0002-2446-8594"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kyle Fox","raw_affiliation_strings":["Duke University, Durham, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip N. Klein","raw_affiliation_strings":["Brown University, Providence, RI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002336559","display_name":"Shay Mozes","orcid":"https://orcid.org/0000-0001-9262-1821"},"institutions":[{"id":"https://openalex.org/I138898306","display_name":"Reichman University","ror":"https://ror.org/01px5cv07","country_code":"IL","type":"education","lineage":["https://openalex.org/I138898306"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shay Mozes","raw_affiliation_strings":["Interdisciplinary Center, Herzliya, Israel","Interdisciplinary Center Herzliya, Israel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Interdisciplinary Center, Herzliya, Israel","institution_ids":["https://openalex.org/I138898306"]},{"raw_affiliation_string":"Interdisciplinary Center Herzliya, Israel#TAB#","institution_ids":["https://openalex.org/I138898306"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4118,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.52372243,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"841","last_page":"850"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/planar","display_name":"Planar","score":0.7044894099235535},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.6739913821220398},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6310848593711853},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6096178889274597},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5419711470603943},{"id":"https://openalex.org/keywords/bisection-method","display_name":"Bisection method","score":0.49206775426864624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41980892419815063},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41842490434646606},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.40622854232788086},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3155703544616699},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1512601375579834},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12146690487861633},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.060780078172683716}],"concepts":[{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.7044894099235535},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.6739913821220398},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6310848593711853},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6096178889274597},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5419711470603943},{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.49206775426864624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41980892419815063},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41842490434646606},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.40622854232788086},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3155703544616699},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1512601375579834},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12146690487861633},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.060780078172683716}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2746539.2746564","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746564","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3826479894","display_name":null,"funder_award_id":"CCF-09-40671,CCF-10-12254,CCF-0964037,CCF-1409520","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7259805039","display_name":null,"funder_award_id":"ISF 749/13","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W71390494","https://openalex.org/W171155747","https://openalex.org/W331230322","https://openalex.org/W1573558634","https://openalex.org/W1969834826","https://openalex.org/W1990313671","https://openalex.org/W1995473411","https://openalex.org/W2019137761","https://openalex.org/W2024654848","https://openalex.org/W2030087828","https://openalex.org/W2038643780","https://openalex.org/W2045749371","https://openalex.org/W2049413646","https://openalex.org/W2065166038","https://openalex.org/W2065641139","https://openalex.org/W2067976091","https://openalex.org/W2068019092","https://openalex.org/W2082176459","https://openalex.org/W2088647669","https://openalex.org/W2088844265","https://openalex.org/W2103099082","https://openalex.org/W2129027842","https://openalex.org/W2131926707","https://openalex.org/W2132169470","https://openalex.org/W2132987209","https://openalex.org/W2150148016","https://openalex.org/W2152195131","https://openalex.org/W2156760067","https://openalex.org/W2166937960","https://openalex.org/W2169528477","https://openalex.org/W2570206580","https://openalex.org/W2963816213"],"related_works":["https://openalex.org/W2329494729","https://openalex.org/W41290553","https://openalex.org/W3112697985","https://openalex.org/W1986919722","https://openalex.org/W2585516632","https://openalex.org/W2093663313","https://openalex.org/W4296983618","https://openalex.org/W2537901922","https://openalex.org/W4298846451","https://openalex.org/W2953052739"],"abstract_inverted_index":{"Given":[0],"an":[1],"undirected":[2],"graph":[3,65],"with":[4,122],"edge":[5,32],"costs":[6,33],"and":[7,91],"node":[8,124],"weights,":[9,125],"the":[10,19,29,35,56,79,92,98,105,109,138,146,150],"minimum":[11,119],"bisection":[12,48],"problem":[13,136],"asks":[14],"for":[15,47,117,145],"a":[16,41,63,76,133,142],"partition":[17,99],"of":[18,24,31,59,78,95,108,149],"nodes":[20,61,80],"into":[21],"two":[22],"parts":[23,36],"equal":[25],"weight":[26,58,144],"such":[27,81],"that":[28,82],"sum":[30],"between":[34],"is":[37,100],"minimized.":[38],"We":[39],"give":[40],"polynomial":[42],"time":[43],"bicriteria":[44],"approximation":[45,116],"scheme":[46],"on":[49],"planar":[50,64,118],"graphs.":[51],"Specifically,":[52],"let":[53],"W":[54],"be":[55],"total":[57,93,106],"all":[60],"in":[62],"G.":[66],"For":[67],"any":[68],"constant":[69],"\u03b5":[70,90],">":[71],"0,":[72],"our":[73],"algorithm":[74,130],"outputs":[75],"bipartition":[77],"each":[83],"part":[84],"weighs":[85],"at":[86,101],"most":[87,102],"W/2":[88],"+":[89],"cost":[94,107],"edges":[96],"crossing":[97],"(1+\u03b5)":[103],"times":[104],"optimal":[110],"bisection.":[111],"The":[112],"previously":[113],"best":[114],"known":[115],"bisection,":[120],"even":[121],"unit":[123],"was":[126],"~O(log":[127],"n).":[128],"Our":[129],"actually":[131],"solves":[132],"more":[134],"general":[135],"where":[137],"input":[139],"may":[140],"include":[141],"target":[143],"smaller":[147],"side":[148],"bipartition.":[151]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}