{"id":"https://openalex.org/W7147607157","doi":"https://doi.org/10.1145/3798129.3800877","title":"Approximation Algorithms for Satisfiable and Nearly Satisfiable Ordering CSPs","display_name":"Approximation Algorithms for Satisfiable and Nearly Satisfiable Ordering CSPs","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7147607157","doi":"https://doi.org/10.1145/3798129.3800877"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800877","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800877","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800877","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068045392","display_name":"Yury Makarychev","orcid":"https://orcid.org/0000-0003-3114-3947"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yury Makarychev","raw_affiliation_strings":["Toyota Technological Institute at Chicago, Chicago, USA"],"raw_orcid":"https://orcid.org/0000-0003-3114-3947","affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, Chicago, USA","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068045392"],"corresponding_institution_ids":["https://openalex.org/I160992636"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.49182293,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1692","last_page":"1703"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9825000166893005,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9825000166893005,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.004699999932199717,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.00279999990016222,"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/arity","display_name":"Arity","score":0.8223999738693237},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5825999975204468},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5774000287055969},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.5195000171661377},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5076000094413757},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.490200012922287},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4814000129699707},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.36719998717308044}],"concepts":[{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.8223999738693237},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5825999975204468},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5774000287055969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5490999817848206},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.5195000171661377},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5076000094413757},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.490200012922287},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4814000129699707},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4083000123500824},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.36719998717308044},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.36719998717308044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3497999906539917},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.349700003862381},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33009999990463257},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.3203999996185303},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.31049999594688416},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3034000098705292},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.2897999882698059},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.2728999853134155},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2567000091075897},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3798129.3800877","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800877","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2603.30020","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2603.30020","pdf_url":"https://arxiv.org/pdf/2603.30020","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800877","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800877","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3112701850","display_name":"Collaborative Research: AF: Medium: Design and Analysis of Models and Algorithms for Real-life Problems","funder_award_id":"1955173","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3679317512","display_name":"Institute for Data, Econometrics, Algorithms and Learning (IDEAL)","funder_award_id":"2216899","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8257104411","display_name":null,"funder_award_id":"CCF-1955173","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337392","display_name":"Division of Electrical, Communications and Cyber Systems","ror":"https://ror.org/01krpsy48"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,36,137],"study":[1],"approximation":[2,43,81,135,215],"algorithms":[3,44,82],"for":[4,41,45,72,80,174,217],"satisfiable":[5,8],"and":[6,23,62,143,165,206,212],"nearly":[7],"instances":[9],"of":[10,100,109,192,221],"ordering":[11,46,57,71,177,222],"constraint":[12,178],"satisfaction":[13],"problems":[14],"(ordering":[15],"CSPs).":[16],"Ordering":[17],"CSPs":[18],"arise":[19],"naturally":[20],"in":[21,120,200],"ranking":[22],"scheduling,":[24],"yet":[25],"their":[26],"approximability":[27],"remains":[28],"poorly":[29],"understood":[30],"beyond":[31],"a":[32,38,65,106,127,172,183,218],"few":[33],"isolated":[34],"cases.":[35],"introduce":[37],"general":[39],"framework":[40,49,102,122,209],"designing":[42],"CSPs.":[47],"The":[48,208],"relaxes":[50],"an":[51,55,70,84,151],"input":[52],"instance":[53],"to":[54,68,83,95,150],"auxiliary":[56],"CSP,":[58],"solves":[59],"the":[60,73,78,98,121,133,160,166,193,198],"relaxation,":[61],"then":[63,138],"applies":[64,210],"randomized":[66,88],"transformation":[67,118,130,186],"obtain":[69],"original":[74],"instance.":[75],"This":[76],"reduces":[77,149],"search":[79],"optimization":[85,153],"problem":[86,154],"over":[87,147],"transformations.":[89],"Our":[90],"main":[91],"technical":[92],"contribution":[93],"is":[94,103,189],"show":[96,144],"that":[97,145],"power":[99],"this":[101],"captured":[104],"by":[105,126,197],"structured":[107],"class":[108,220],"transformations,":[110],"which":[111],"we":[112,180],"call":[113],"strong":[114,128,140,184],"IDU":[115,129,141,185],"transformations:":[116],"every":[117],"used":[119],"can":[123,181],"be":[124],"replaced":[125],"without":[131],"weakening":[132],"resulting":[134],"guarantee.":[136],"classify":[139],"transformations":[142],"optimizing":[146],"them":[148],"explicit":[152],"whose":[155,187],"dimension":[156],"depends":[157],"only":[158,203],"on":[159,204],"maximum":[161],"predicate":[162],"arity":[163],"$k$":[164,205],"desired":[167],"precision":[168],"$\u03b4>":[169],"0$.":[170],"As":[171],"consequence,":[173],"any":[175],"finite":[176],"language,":[179],"compute":[182],"guarantee":[188,195],"within":[190],"$\u03b4$":[191],"best":[194],"achievable":[196],"framework,":[199],"time":[201],"depending":[202],"$\u03b4$.":[207],"broadly":[211],"yields":[213],"nontrivial":[214],"guarantees":[216],"wide":[219],"predicates.":[223]},"counts_by_year":[],"updated_date":"2026-06-10T14:10:52.464848","created_date":"2026-04-02T00:00:00"}