{"id":"https://openalex.org/W2033191240","doi":"https://doi.org/10.1145/1148109.1148142","title":"Tight bounds for the Min-Max boundary decomposition cost of weighted graphs","display_name":"Tight bounds for the Min-Max boundary decomposition cost of weighted graphs","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W2033191240","doi":"https://doi.org/10.1145/1148109.1148142","mag":"2033191240"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148142","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","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/A5089128021","display_name":"David Steurer","orcid":"https://orcid.org/0000-0002-3908-8180"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Steurer","raw_affiliation_strings":["MPI Informatik, Stuhlsatzenhausweg, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MPI Informatik, Stuhlsatzenhausweg, Saarbr\u00fccken, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5089128021"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"197","last_page":"206"},"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.9990000128746033,"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.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8186902403831482},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6929849982261658},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6881641745567322},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5442460179328918},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4426393210887909},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4264589846134186},{"id":"https://openalex.org/keywords/separator","display_name":"Separator (oil production)","score":0.4215490221977234},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41855695843696594},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4103136360645294},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11539861559867859},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07304596900939941}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8186902403831482},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6929849982261658},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6881641745567322},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5442460179328918},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4426393210887909},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4264589846134186},{"id":"https://openalex.org/C185004128","wikidata":"https://www.wikidata.org/wiki/Q3011536","display_name":"Separator (oil production)","level":2,"score":0.4215490221977234},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41855695843696594},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4103136360645294},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11539861559867859},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07304596900939941},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1148109.1148142","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.7041","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.7041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0606001v1.pdf","raw_type":"text"},{"id":"pmh:oai:escidoc.org:escidoc:2039724","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0019-E339-0","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1971758446","https://openalex.org/W1997631839","https://openalex.org/W2017376066","https://openalex.org/W2038643780","https://openalex.org/W2053653244","https://openalex.org/W2067976091","https://openalex.org/W2068019092","https://openalex.org/W2073558110","https://openalex.org/W2077571023"],"related_works":["https://openalex.org/W4249175327","https://openalex.org/W2063487995","https://openalex.org/W2971636757","https://openalex.org/W2511745526","https://openalex.org/W4301098834","https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3211941742","https://openalex.org/W2035944803","https://openalex.org/W4287601324"],"abstract_inverted_index":{"Many":[0],"load":[1],"balancing":[2],"problems":[3],"that":[4,34,62,95,131,143],"arise":[5],"in":[6,101,119,184],"scientific":[7],"computing":[8,192],"applications":[9],"ask":[10],"to":[11,99,110,173,188,206,210],"partition":[12,180],"a":[13,26,64,193,211,219,249],"graph":[14],"with":[15,55,218,243],"weights":[16,129],"on":[17,22,200],"the":[18,23,35,87,96,102,113,120,132,144,151,162,189,201,246],"vertices":[19,133],"and":[20,128,161,239],"costs":[21,57,203],"edges":[24,97,118,164],"into":[25,82,139],"given":[27],"number":[28],"of":[29,77,85,134,146,165,196,222],"almost":[30],"equally-weighted":[31],"parts":[32,41,84,141,242],"such":[33,94,142],"maximum":[36],"boundary":[37,163,202],"cost":[38,106,169],"over":[39,116],"all":[40,117,124],"is":[42,47,115,204],"small.Here,":[43],"this":[44,227],"partitioning":[45],"problem":[46],"considered":[48],"for":[49,67,123,191,214],"boundeddegree":[50],"graphs":[51],"G":[52,78,135],"\u2261":[53,234,237],"(V,E)":[54],"edge":[56],"c:":[58],"E":[59],"\u2192":[60],"R+":[61],"have":[63,104,168],"p-separator":[65],"theorem":[66],"some":[68],"p":[69],">":[70],"1,":[71,235,238],"i.e.,":[72],"any":[73],"(arbitrarily":[74],"weighted)":[75],"subgraph":[76,103],"can":[79,136,181],"be":[80,137,182,207],"separated":[81],"two":[83],"roughly":[86],"same":[88],"weight":[89,145,153,244],"by":[90,156,248],"removing":[91],"separator":[92,194],"S\u2286V":[93],"incident":[98],"S":[100,195],"total":[105],"at":[107,170],"most":[108,171],"proportional":[109,172,187],"(\u0395ecp<over>e)1/p,":[111],"where":[112],"sum":[114],"subgraph.We":[121],"show":[122],"positive":[125],"integers":[126],"k":[127,140],"w":[130,236],"partitioned":[138],"each":[147,166],"part":[148,167],"differs":[149],"from":[150],"average":[152,247],"\u0395v\u2208V":[154],"wv<over>k":[155],"less":[157],"than":[158],"maxv\u2208V":[159],"wv,":[160],"(\u0395e\u2208":[174],"cp<over>e/k)1/p":[175],"+":[176],"maxe\u2208E":[177],"ce.":[178],"The":[179],"computed":[183],"time":[185,190],"nearly":[186],"G.Our":[197],"upper":[198],"bound":[199,228],"shown":[205],"tight":[208],"up":[209],"constant":[212,250],"factor":[213],"infinitely":[215],"many":[216],"instances":[217],"broad":[220],"range":[221],"parameters.":[223],"Previous":[224],"results":[225],"achieved":[226],"only":[229],"if":[230],"one":[231,240],"has":[232],"c":[233],"allows":[241],"exceeding":[245],"fraction.":[251]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}