{"id":"https://openalex.org/W7135101125","doi":"https://doi.org/10.1016/j.tcs.2026.115881","title":"Approximating submodular matroid-constrained partitioning","display_name":"Approximating submodular matroid-constrained partitioning","publication_year":2026,"publication_date":"2026-03-13","ids":{"openalex":"https://openalex.org/W7135101125","doi":"https://doi.org/10.1016/j.tcs.2026.115881"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2026.115881","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115881","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.tcs.2026.115881","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Krist\u00f3f B\u00e9rczi","orcid":"https://orcid.org/0000-0003-0457-4573"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Krist\u00f3f B\u00e9rczi","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0457-4573","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128821885","display_name":"Tam\u00e3\u00a1s Kir\u00e3\u00a1ly","orcid":null},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]},{"id":"https://openalex.org/I4210104188","display_name":"Optimization Technology (United States)","ror":"https://ror.org/01kcex014","country_code":"US","type":"company","lineage":["https://openalex.org/I4210104188"]}],"countries":["HU","US"],"is_corresponding":false,"raw_author_name":"Tam\u00e1s Kir\u00e1ly","raw_affiliation_strings":["Department of Operations Research, E\u00c3\u00b6tv\u00c3\u00b6s Lor\u00c3\u00a1nd University, Budapest, Hungary","HUN-REN\u2013ELTE Egerv\u00c3\u00a1ry Research Group on Combinatorial Optimization"],"raw_orcid":"https://orcid.org/0000-0001-7218-2112","affiliations":[{"raw_affiliation_string":"Department of Operations Research, E\u00c3\u00b6tv\u00c3\u00b6s Lor\u00c3\u00a1nd University, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"HUN-REN\u2013ELTE Egerv\u00c3\u00a1ry Research Group on Combinatorial Optimization","institution_ids":["https://openalex.org/I4210104188"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128918743","display_name":"Daniel P. Szabo","orcid":null},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Daniel P. Szabo","raw_affiliation_strings":["Department of Operations Research, E\u00c3\u00b6tv\u00c3\u00b6s Lor\u00c3\u00a1nd University, Budapest, Hungary"],"raw_orcid":"https://orcid.org/0009-0009-7263-1614","affiliations":[{"raw_affiliation_string":"Department of Operations Research, E\u00c3\u00b6tv\u00c3\u00b6s Lor\u00c3\u00a1nd University, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011591780","display_name":"Karthekeyan Chandrasekaran","orcid":"https://orcid.org/0000-0002-3421-7238"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karthekeyan Chandrasekaran","raw_affiliation_strings":["Grainger College of Engineering, University of Illinois, Urbana-Champaign, USA"],"raw_orcid":"https://orcid.org/0000-0002-3421-7238","affiliations":[{"raw_affiliation_string":"Grainger College of Engineering, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5128918743"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.5235007,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1073","issue":null,"first_page":"115881","last_page":"115881"},"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.7279999852180481,"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.7279999852180481,"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.08860000222921371,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.07020000368356705,"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/submodular-set-function","display_name":"Submodular set function","score":0.8040000200271606},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.36500000953674316},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.31679999828338623},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.3167000114917755},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2842999994754791}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8040000200271606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5450000166893005},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4945000112056732},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38690000772476196},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.36500000953674316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3589000105857849},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3434000015258789},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31679999828338623},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2529999911785126}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.tcs.2026.115881","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115881","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2026.115881","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115881","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322192","display_name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","ror":"https://ror.org/02ks8qq67"},{"id":"https://openalex.org/F4320328860","display_name":"Magyarorsz\u00e1g Korm\u00e1nya","ror":"https://ror.org/007ekx298"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1975361422","https://openalex.org/W2026838540","https://openalex.org/W2050977796","https://openalex.org/W2063597011","https://openalex.org/W2112306992","https://openalex.org/W2122466336","https://openalex.org/W2152986618","https://openalex.org/W2326889392","https://openalex.org/W2613308084","https://openalex.org/W3112296152","https://openalex.org/W4405417635"],"related_works":[],"abstract_inverted_index":{"The":[0,31],"submodular":[1,22,109,159],"partitioning":[2],"problem":[3,32,150],"asks":[4],"to":[5,127],"minimize,":[6],"over":[7,25,121],"all":[8],"partitions":[9],"P":[10,29,83,131,142],"of":[11,19,28,76,96,148],"a":[12,20,74,101,119,129],"ground":[13,123],"set":[14,75,124],"V":[15],",":[16,84],"the":[17,26,66,86,90,94,97,122,146],"sum":[18],"given":[21,73,118],"function":[23],"f":[24],"parts":[27],".":[30,143],"has":[33,62],"seen":[34],"considerable":[35],"work":[36],"in":[37,132],"approximability,":[38],"as":[39,56],"it":[40],"encompasses":[41],"multiterminal":[42],"cuts":[43],"on":[44,48],"graphs,":[45],"k":[46],"-cuts":[47],"hypergraphs,":[49],"and":[50,85,125,151,157],"elementary":[51],"linear":[52],"algebra":[53],"problems":[54],"such":[55],"matrix":[57],"multiway":[58],"partitioning.":[59],"This":[60],"research":[61],"been":[63],"divided":[64],"between":[65],"fixed":[67],"terminal":[68],"setting,":[69,88],"where":[70,89],"we":[71,115],"are":[72,116],"terminals":[77],"that":[78,103,138],"must":[79],"be":[80],"separated":[81,140],"by":[82,141],"global":[87],"only":[91],"constraint":[92],"is":[93,139],"size":[95],"partition.":[98,111],"We":[99,144],"investigate":[100],"generalization":[102],"unifies":[104],"these":[105],"two":[106],"settings:":[107],"minimum":[108],"matroid-constrained":[110],"In":[112],"this":[113,149],"problem,":[114],"additionally":[117],"matroid":[120],"seek":[126],"find":[128],"partition":[130],"which":[133],"there":[134],"exists":[135],"some":[136],"basis":[137],"explore":[145],"approximability":[147],"its":[152],"variants":[153],"for":[154],"general,":[155],"symmetric,":[156],"monotone":[158],"functions.":[160]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2026-03-13T00:00:00"}