{"id":"https://openalex.org/W7136154251","doi":"https://doi.org/10.48550/arxiv.2603.13147","title":"A common parallel framework for LLP combinatorial problems","display_name":"A common parallel framework for LLP combinatorial problems","publication_year":2026,"publication_date":"2026-03-13","ids":{"openalex":"https://openalex.org/W7136154251","doi":"https://doi.org/10.48550/arxiv.2603.13147"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.13147","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13147","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2603.13147","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124952106","display_name":"David Ribeiro Alves","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alves, David Ribeiro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5129493592","display_name":"Vijay K. Garg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Garg, Vijay K.","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.22349999845027924,"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.22349999845027924,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.2084999978542328,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.14020000398159027,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.590499997138977},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"Combinatorial algorithms","score":0.5260000228881836},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4510999917984009},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.40230000019073486},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.37860000133514404},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.36419999599456787},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.3587999939918518},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.3587999939918518}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5910999774932861},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.590499997138977},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.5260000228881836},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4510999917984009},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41280001401901245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4075999855995178},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.40230000019073486},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.37860000133514404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3700000047683716},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.36419999599456787},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.3587999939918518},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.3587999939918518},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3483999967575073},{"id":"https://openalex.org/C2779521423","wikidata":"https://www.wikidata.org/wiki/Q3855646","display_name":"Combinatorial method","level":2,"score":0.3411000072956085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3301999866962433},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.3222000002861023},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.31850001215934753},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3043999969959259},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C95203288","wikidata":"https://www.wikidata.org/wiki/Q221682","display_name":"Semaphore","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.27480000257492065},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.26510000228881836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.13147","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13147","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.13147","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13147","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.6883071660995483,"id":"https://metadata.un.org/sdg/5","display_name":"Gender equality"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Traditional":[0],"lock-free":[1,30],"parallel":[2,55],"algorithms":[3],"for":[4,116],"combinatorial":[5,37,85],"optimization":[6,38,86],"problems,":[7,87],"such":[8,88],"as":[9,44,89],"shortest":[10],"paths,":[11],"stable":[12],"matching,":[13],"and":[14,23,71,106,120],"job":[15],"scheduling":[16],"require":[17],"programmers":[18],"to":[19],"write":[20],"problem-specific":[21,62],"routines":[22],"synchronization":[24],"code.":[25],"We":[26,77,109],"propose":[27],"a":[28,45,57,65,72],"general-purpose":[29],"runtime,":[31],"LLP-FW":[32,80,111],"that":[33,40,79,122],"can":[34,41,81],"solve":[35,82],"all":[36,50],"problems":[39,119],"be":[42],"formulated":[43],"Lattice-Linear":[46],"Predicate":[47],"by":[48],"advancing":[49],"forbidden":[51],"local":[52],"states":[53],"in":[54,126],"until":[56],"solution":[58],"emerges.":[59],"The":[60],"only":[61],"code":[63],"is":[64],"definition":[66,73],"of":[67,74,129],"the":[68,75,127],"forbiddenness":[69],"check":[70],"advancement.":[76],"show":[78,121],"several":[83],"different":[84],"Single":[90],"Source":[91],"Shortest":[92],"Paths":[93],"(SSSP),":[94],"Breadth-First":[95],"Search":[96],"(BFS),":[97],"Stable":[98],"Marriage,":[99],"Job":[100],"Scheduling,":[101],"Transitive":[102],"Closure,":[103],"Parallel":[104],"Reduction,":[105],"0-1":[107],"Knapsack.":[108],"compare":[110],"against":[112],"hand-tuned,":[113],"custom":[114],"solutions":[115],"these":[117],"seven":[118],"it":[123],"compares":[124],"favorably":[125],"majority":[128],"cases.":[130]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-17T00:00:00"}