{"id":"https://openalex.org/W7165362896","doi":"https://doi.org/10.48550/arxiv.2606.20202","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","display_name":"Tight Algorithm and Hardness for Submodular Linear Ordering","publication_year":2026,"publication_date":"2026-06-18","ids":{"openalex":"https://openalex.org/W7165362896","doi":"https://doi.org/10.48550/arxiv.2606.20202"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.20202","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20202","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.20202","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138980759","display_name":"Evan Abboud","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abboud, Evan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068494085","display_name":"Roy Schwartz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schwartz, Roy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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.9603999853134155,"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.9603999853134155,"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.03009999915957451,"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.0010999999940395355,"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/submodular-set-function","display_name":"Submodular set function","score":0.8895000219345093},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7128999829292297},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.5184000134468079},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5135999917984009},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4993000030517578},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45260000228881836},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4490000009536743},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4246000051498413}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8895000219345093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7810999751091003},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7128999829292297},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.588699996471405},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.5184000134468079},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5135999917984009},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4993000030517578},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48510000109672546},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45260000228881836},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4490000009536743},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4246000051498413},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.37689998745918274},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.3483000099658966},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.33559998869895935},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.3253999948501587},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.3230000138282776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31029999256134033},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C2778408900","wikidata":"https://www.wikidata.org/wiki/Q1329258","display_name":"Cardinal number (linguistics)","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.26100000739097595}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.20202","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20202","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.20202","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20202","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,24,36,39,60,89,92,143,159],"Minimum":[3,76,80,93],"Linear":[4,77,94],"Ordering":[5,95],"Problem:":[6],"given":[7],"a":[8,16,63,98,112,121,132],"ground":[9],"set":[10,18,57],"$N$":[11,33],"of":[12,32,38,41,46,56,62,67,91,135,147],"cardinality":[13],"$n$":[14],"and":[15,59,79,106,109,119,151,167],"non-negative":[17],"function":[19],"$f\\colon":[20],"2^N\\rightarrow":[21],"\\mathbb{R}_{\\geq":[22],"0}$,":[23],"goal":[25],"is":[26,66,164],"to":[27],"find":[28],"an":[29,116,139,152],"ordering":[30],"$\u03c0$":[31],"that":[34,127],"minimizes":[35],"sum":[37],"values":[40],"$f$":[42,65,101,131,163],"over":[43],"all":[44],"prefixes":[45],"$\u03c0$.":[47],"This":[48],"problem":[49],"has":[50],"been":[51],"studied":[52],"for":[53,97,158],"various":[54],"classes":[55],"functions,":[58],"case":[61,161],"submodular":[64,100,166],"special":[68,160],"interest,":[69],"as":[70],"it":[71],"captures":[72],"classic":[73],"problems":[74],"including":[75],"Arrangement":[78],"Containing":[81],"Interval":[82],"Graph.":[83],"In":[84],"this":[85],"work,":[86],"we":[87],"resolve":[88],"approximability":[90],"Problem":[96],"general":[99],"by":[102],"establishing":[103],"matching":[104,122],"upper":[105],"lower":[107],"bounds":[108],"present:":[110],"$(1)$":[111],"polynomial-time":[113],"algorithm":[114,129],"achieving":[115],"$O(\\sqrt{n/\\ln":[117,153],"n})$-approximation;":[118],"$(2)$":[120],"information-theoretic":[123],"hardness":[124,146],"result,":[125],"showing":[126],"no":[128],"evaluating":[130],"polynomial":[133],"number":[134],"times":[136],"can":[137],"achieve":[138],"$o(\\sqrt{n/\\ln":[140],"n})$-approximation.":[141],"Previously,":[142],"best":[144],"known":[145,156],"approximation":[148],"was":[149,155],"$2$,":[150],"n})$-approximation":[154],"only":[157],"where":[162],"both":[165],"symmetric.":[168]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-20T00:00:00"}