{"id":"https://openalex.org/W7131404764","doi":"https://doi.org/10.4230/lipics.stacs.2026.79","title":"Mind the Gap. Doubling Constant Parametrization of Weighted Problems: TSP, Max-Cut, and More","display_name":"Mind the Gap. Doubling Constant Parametrization of Weighted Problems: TSP, Max-Cut, and More","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7131404764","doi":"https://doi.org/10.4230/lipics.stacs.2026.79"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25568","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.79","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.79","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Stoian, Mihail","orcid":"https://orcid.org/0000-0002-8843-3374"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Stoian, Mihail","raw_affiliation_strings":["University of Technology Nuremberg, Germany"],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.65020576,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.705299973487854,"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.705299973487854,"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.10869999974966049,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.0746999979019165,"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/bounded-function","display_name":"Bounded function","score":0.6080999970436096},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5950000286102295},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5906000137329102},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5450000166893005},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5432000160217285},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4887999892234802},{"id":"https://openalex.org/keywords/parametrization","display_name":"Parametrization (atmospheric modeling)","score":0.44780001044273376}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7055000066757202},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6080999970436096},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5950000286102295},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5906000137329102},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5450000166893005},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5432000160217285},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4887999892234802},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45210000872612},{"id":"https://openalex.org/C202887219","wikidata":"https://www.wikidata.org/wiki/Q3895221","display_name":"Parametrization (atmospheric modeling)","level":3,"score":0.44780001044273376},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4406999945640564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36399999260902405},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34290000796318054},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32199999690055847},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2558000087738037},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25568","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.79","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.stacs.2026.79","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2026.79","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25568","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.79","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"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":{"Despite":[0],"much":[1],"research,":[2],"hard":[3],"weighted":[4,44,71],"problems":[5,23,100],"still":[6],"resist":[7],"super-polynomial":[8],"improvements":[9],"over":[10,102],"their":[11,123],"textbook":[12],"solution.":[13],"On":[14],"the":[15,18,27,31,36,39,43,53,63,83,86,93,103,127,143,151,164],"other":[16],"hand,":[17],"unweighted":[19,40,87,124],"versions":[20,125],"of":[21,38,52,85,96,122,129],"these":[22],"have":[24],"recently":[25],"witnessed":[26],"sought-after":[28],"speedups.":[29],"Currently,":[30],"only":[32],"way":[33,80],"to":[34,47,81,120],"repurpose":[35,82],"algorithm":[37,84],"version":[41,45],"for":[42,69],"is":[46,118],"employ":[48],"a":[49,59,78,139],"polynomial":[50,165],"embedding":[51],"input":[54,130,144],"weights.":[55],"This,":[56],"however,":[57],"introduces":[58],"pseudo-polynomial":[60],"factor":[61],"into":[62,146],"running":[64],"time,":[65],"which":[66],"becomes":[67],"impractical":[68],"arbitrarily":[70],"instances.":[72],"In":[73],"this":[74,137],"paper,":[75],"we":[76,90],"introduce":[77],"new":[79],"problem.":[88],"Specifically,":[89],"show":[91],"that":[92,121,141],"time":[94],"complexity":[95],"several":[97],"well-known":[98],"NP-hard":[99],"operating":[101],"(min,":[104],"+)":[105,108],"and":[106,115,158],"(max,":[107],"semirings,":[109],"such":[110],"as":[111],"TSP,":[112],"Weighted":[113],"Max-Cut,":[114],"Edge-Weighted":[116],"k-Clique,":[117],"proportional":[119],"when":[126],"set":[128],"weights":[131,145],"has":[132],"small":[133],"doubling.":[134],"We":[135],"achieve":[136],"by":[138,156],"meta-algorithm":[140],"converts":[142],"polynomially":[147],"bounded":[148],"integers":[149],"using":[150],"recent":[152],"constructive":[153],"Freiman\u2019s":[154],"theorem":[155],"Randolph":[157],"W\u0119grzycki":[159],"[ESA":[160],"2024]":[161],"before":[162],"applying":[163],"embedding.":[166]},"counts_by_year":[],"updated_date":"2026-03-22T08:09:32.410652","created_date":"2026-02-15T00:00:00"}