{"id":"https://openalex.org/W7125962736","doi":"https://doi.org/10.13016/vdf6-wrbq","title":"FROM HARDNESS TO STRUCTURE: ALGORITHMIC INSIGHTS FROM SAT, DIVERSITY, AND CONNECTIVITY","display_name":"FROM HARDNESS TO STRUCTURE: ALGORITHMIC INSIGHTS FROM SAT, DIVERSITY, AND CONNECTIVITY","alternate_titles":[],"publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7125962736","doi":"https://doi.org/10.13016/vdf6-wrbq"},"language":"en","primary_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/35144","doi":null,"is_oa":false,"landing_page_url":"https://doi.org/10.13016/vdf6-wrbq","pdf_url":null,"source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Dissertation"},"parent_works":[],"lineage":["https://openalex.org/W7125962736"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.13016/vdf6-wrbq","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102708610","display_name":"Ali Ahmadi","orcid":"https://orcid.org/0000-0002-5074-5014","observed_orcids":["https://orcid.org/0000-0002-5074-5014"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ahmadi, Ali","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5102708610"],"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_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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.9965999722480774,"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.0024999999441206455,"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.00019999999494757503,"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/hardness-of-approximation","display_name":"hardness of approximation","score":0.6549999713897705},{"id":"https://openalex.org/keywords/k-sat","display_name":"k-SAT","score":0.7480000257492065},{"id":"https://openalex.org/keywords/diversity-maximization","display_name":"diversity maximization","score":0.8080000281333923},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.703000009059906},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.6629999876022339},{"id":"https://openalex.org/keywords/steiner-forest","display_name":"Steiner forest","score":0.9869999885559082},{"id":"https://openalex.org/keywords/network-design","display_name":"network design","score":0.5929999947547913},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.6729999780654907},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"combinatorial algorithms","score":0.4410000145435333}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5968000292778015},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5823000073432922},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5436000227928162},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5221999883651733},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5105999708175659},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4404999911785126},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4368000030517578},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42250001430511475},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3935999870300293},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.38109999895095825},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.37869998812675476},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.35530000925064087},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3546999990940094},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.3531000018119812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3513999879360199},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C116222747","wikidata":"https://www.wikidata.org/wiki/Q220888","display_name":"Falsifiability","level":2,"score":0.33059999346733093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31869998574256897},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31349998712539673},{"id":"https://openalex.org/C122451846","wikidata":"https://www.wikidata.org/wiki/Q5150824","display_name":"Combinatorial design","level":2,"score":0.30720001459121704},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.3001999855041504},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29820001125335693},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2637999951839447},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.2531999945640564},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.2529999911785126},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.25270000100135803}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drum.lib.umd.edu:1903/35144","doi":null,"is_oa":false,"landing_page_url":"https://doi.org/10.13016/vdf6-wrbq","pdf_url":null,"source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Dissertation"},{"id":"doi:10.13016/vdf6-wrbq","doi":"https://doi.org/10.13016/vdf6-wrbq","is_oa":true,"landing_page_url":"https://doi.org/10.13016/vdf6-wrbq","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Collection"}],"best_oa_location":{"id":"doi:10.13016/vdf6-wrbq","doi":"https://doi.org/10.13016/vdf6-wrbq","is_oa":true,"landing_page_url":"https://doi.org/10.13016/vdf6-wrbq","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Collection"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2304390796","https://openalex.org/W7027391564","https://openalex.org/W2280765959","https://openalex.org/W3209546412","https://openalex.org/W7152389828","https://openalex.org/W7133265572","https://openalex.org/W6980002695","https://openalex.org/W6963298553","https://openalex.org/W7109991138","https://openalex.org/W844866297"],"abstract_inverted_index":{"This":[0,302],"thesis":[1,58,149,229,273],"investigates":[2],"the":[3,54,57,60,103,134,142,175,218,228,245,254,259,272,290,294,320,347],"deep":[4],"interplay":[5],"between":[6],"hardness":[7,49,132,332,343],"and":[8,16,34,133,179,190,207,223,238,248,257,279],"structure":[9,237,348],"in":[10,163,235,298,310],"combinatorial":[11,152,191,236,250],"optimization,":[12],"demonstrating":[13],"how":[14,187],"uncovering":[15,127,346],"formalizing":[17],"structural":[18,317],"regularities":[19],"within":[20,349],"complex":[21],"problems":[22,202],"enables":[23],"progress":[24,338],"beyond":[25,293],"long-standing":[26,260],"computational":[27],"barriers.":[28],"Spanning":[29],"three":[30],"domains\u2014Satisfiability":[31],"(SAT),":[32],"Diversity,":[33],"Connectivity\u2014the":[35],"presented":[36],"works":[37],"collectively":[38],"develop":[39],"a":[40,79,167,276,286,307,316,329],"unifying":[41],"perspective:":[42],"that":[43,102,154,323,336],"algorithmic":[44,232,337],"advancement":[45],"arises":[46,339],"from":[47,109,331],"transforming":[48],"into":[50],"exploitable":[51],"structure.":[52],"In":[53,139,215],"SAT":[55],"domain,":[56],"introduces":[59,275],"first":[61,246,291],"general":[62],"framework":[63,85,282],"for":[64,159,169,201,283,319],"quiet":[65],"planting":[66],"of":[67,82,90,136,322],"$k$-SAT":[68],"formulas":[69,105],"with":[70,93,124],"multiple":[71],"planted":[72,91],"solutions.":[73],"Unlike":[74],"previous":[75],"models":[76],"limited":[77],"to":[78,145,197,205,333],"constant":[80],"number":[81,89],"solutions,":[83],"this":[84],"supports":[86],"an":[87],"arbitrary":[88],"assignments":[92],"prescribed":[94],"pairwise":[95],"Hamming":[96],"distances":[97],"(arbitrary":[98],"geometry),":[99],"while":[100,263],"ensuring":[101],"resulting":[104],"remain":[106],"statistically":[107],"indistinguishable":[108],"uniformly":[110],"random":[111],"instances":[112],"under":[113],"all":[114],"Statistical":[115],"Query":[116],"algorithms.":[117],"The":[118,148],"construction":[119],"combines":[120],"linear-program":[121],"feasibility":[122],"conditions":[123],"coding-theoretic":[125],"realizations,":[126],"new":[128,231],"principles":[129],"governing":[130],"distributional":[131],"indistinguishability":[135],"structured":[137],"randomness.":[138],"Diversity":[140],"Maximization,":[141],"focus":[143],"shifts":[144],"geometric":[146,188],"optimization.":[147],"presents":[150,244],"deterministic":[151,199,247],"algorithms":[153],"achieve":[155],"near-optimal":[156],"approximation":[157],"ratios":[158],"selecting":[160],"well-separated":[161],"subsets":[162],"metric":[164],"spaces,":[165],"specifically":[166],"$(2/\\varepsilon)$-approximation":[168],"sufficiently":[170],"large":[171],"instances,":[172],"improving":[173],"upon":[174],"best-known":[176],"randomized":[177],"bounds":[178],"establishing":[180],"tight":[181],"lower":[182],"limits.":[183],"These":[184],"results":[185],"illustrate":[186],"separation":[189],"density":[192],"arguments":[193],"can":[194],"be":[195],"combined":[196],"yield":[198],"guarantees":[200],"closely":[203],"related":[204],"clustering":[206],"Max-Cut,":[208],"without":[209],"relying":[210],"on":[211,269],"randomization":[212],"or":[213],"relaxations.":[214],"Connectivity,":[216],"encompassing":[217],"Prize-Collecting":[219],"Steiner":[220,224],"Forest":[221,225],"(PCSF)":[222],"(SFP)":[226],"problems,":[227],"develops":[230],"frameworks":[233],"grounded":[234],"local":[239,280],"refinement.":[240],"For":[241],"PCSF,":[242],"it":[243],"purely":[249],"2-approximation":[251],"algorithm,":[252],"matching":[253],"optimal":[255],"factor":[256,296],"surpassing":[258],"2.54":[261],"bound":[262],"bypassing":[264],"LP-based":[265],"integrality":[266],"limitations.":[267],"Building":[268],"these":[270,326],"ideas,":[271],"then":[274],"boosted":[277],"moat-growing":[278],"search":[281],"SFP,":[284],"yielding":[285],"$(2":[287],"-":[288],"\\varepsilon)$-approximation,":[289],"improvement":[292],"classical":[295],"2":[297],"over":[299],"thirty-five":[300],"years.":[301],"result":[303],"not":[304,340],"only":[305],"breaks":[306],"historic":[308],"barrier":[309],"network":[311],"design":[312],"but":[313,344],"also":[314],"provides":[315],"explanation":[318],"origin":[321],"barrier.":[324],"Together,":[325],"contributions":[327],"trace":[328],"path":[330],"structure,":[334],"showing":[335],"by":[341,345],"avoiding":[342],"it.":[350]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7125962736","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2026-01-29T00:00:00"}
