{"id":"https://openalex.org/W7126041220","doi":"https://doi.org/10.48550/arxiv.2601.20038","title":"Node-Weighted Multicut in Planar Digraphs","display_name":"Node-Weighted Multicut in Planar Digraphs","publication_year":2026,"publication_date":"2026-01-27","ids":{"openalex":"https://openalex.org/W7126041220","doi":"https://doi.org/10.48550/arxiv.2601.20038"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2601.20038","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124225938","display_name":"Chandra Chekuri","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chekuri, Chandra","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5017370583","display_name":"Rhea Jain","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jain, Rhea","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5124225938"],"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":null,"last_page":null},"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.894599974155426,"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.894599974155426,"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.052799999713897705,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.023900000378489494,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5842000246047974},{"id":"https://openalex.org/keywords/planarity-testing","display_name":"Planarity testing","score":0.5770999789237976},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5623000264167786},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5065000057220459},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.44279998540878296},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.39169999957084656}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7373999953269958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7240999937057495},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5842000246047974},{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.5770999789237976},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5623000264167786},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5065000057220459},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.44279998540878296},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40209999680519104},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.39169999957084656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3499999940395355},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C94966114","wikidata":"https://www.wikidata.org/wiki/Q29256","display_name":"Black box","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2601.20038","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2601.20038","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.20038","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2601.20038","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Kawarabayashi":[0],"and":[1,52,59,115,119,126],"Sidiropoulos":[2],"[KS22]":[3,62,112],"obtained":[4],"an":[5,138,147],"$O(\\log^2":[6],"n)$-approximation":[7],"algorithm":[8,58,108,110,125],"for":[9,46,140],"Multicut":[10,66,131],"in":[11,34,61,69,80,111],"planar":[12],"digraphs":[13,48],"via":[14,133],"a":[15,22,37,81,96,106,134],"natural":[16],"LP":[17],"relaxation,":[18],"which":[19],"also":[20],"establishes":[21],"corresponding":[23],"upper":[24],"bound":[25,39],"on":[26,42],"the":[27,43,57,64,87,92,124,141],"multicommodity":[28],"flow-cut":[29,44],"gap.":[30],"Their":[31],"result":[32],"is":[33,113],"contrast":[35],"to":[36,50,63,77,86,98,104,117],"lower":[38],"of":[40,123],"$\\tilde\u03a9(n^{1/7})$":[41],"gap":[45],"general":[47,70],"due":[49,85],"Chuzhoy":[51],"Khanna":[53],"[CK09].":[54],"We":[55,90],"extend":[56],"analysis":[60,127],"node-weighted":[65,72,93],"problem.":[67],"Unlike":[68],"digraphs,":[71],"problems":[73,79],"cannot":[74],"be":[75],"reduced":[76],"edge-weighted":[78],"black":[82],"box":[83],"fashion":[84],"planarity":[88],"restriction.":[89],"use":[91],"problem":[94,145],"as":[95],"vehicle":[97],"accomplish":[99],"two":[100],"additional":[101,148],"goals:":[102],"(i)":[103],"obtain":[105],"deterministic":[107],"(the":[109],"randomized),":[114],"(ii)":[116],"simplify":[118],"clarify":[120],"some":[121],"aspects":[122],"from":[128],"[KS22].":[129],"The":[130],"result,":[132],"standard":[135],"technique,":[136],"implies":[137],"approximation":[139],"Nonuniform":[142],"Sparsest":[143],"Cut":[144],"with":[146],"logarithmic":[149],"factor":[150],"loss.":[151]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-01-30T00:00:00"}