FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4387617469> ?p ?o ?g. }

• W4387617469 abstract "Short spanning trees subject to additional constraints are important building blocks in various approximation algorithms, and moreover, they capture interesting problem settings on their own. Especially in the context of the traveling salesman problem (TSP), new techniques for finding spanning trees with well-defined properties have been crucial in recent progress. We consider the problem of finding a spanning tree subject to constraints on the edges in a family of cuts forming a laminar family of small width. Our main contribution is a new dynamic programming approach in which the value of a table entry does not only depend on the values of previous table entries, as is usually the case, but also on a specific representative solution saved together with each table entry. This allows for handling a broad range of constraint types. In combination with other techniques—including negatively correlated rounding and a polyhedral approach that, in the problems we consider, allows for avoiding potential losses in the objective through the randomized rounding—we obtain several new results. We first present a quasi-polynomial time algorithm for the minimum chain-constrained spanning tree problem with an essentially optimal guarantee. More precisely, each chain constraint is violated by a factor of at most [Formula: see text], and the cost is no larger than that of an optimal solution not violating any chain constraint. The best previous procedure is a bicriteria approximation violating each chain constraint by up to a constant factor and losing another factor in the objective. Moreover, our approach can naturally handle lower bounds on the chain constraints, and it can be extended to constraints on cuts forming a laminar family of constant width. Furthermore, we show how our approach can also handle parity constraints (or, more precisely, a proxy thereof) as used in the context of (path) TSP and one of its generalizations and discuss implications in this context. Funding: This project received funding through the Swiss National Science Foundation [Grants 200021_184622 and P500PT_206742], the European Research Council under the European Union’s Horizon 2020 research and innovation program [Grant 817750], and the Deutsche Forschungsgemeinschaft (German Research Foundation) under Germany’s Excellence Strategy – EXC 2047/1 [Grant 390685813]." @default.
• W4387617469 created "2023-10-14" @default.
• W4387617469 creator A5027137195 @default.
• W4387617469 creator A5033406324 @default.
• W4387617469 date "2023-10-13" @default.
• W4387617469 modified "2023-10-15" @default.
• W4387617469 title "A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond" @default.
• W4387617469 cites W1563055883 @default.
• W4387617469 cites W1714357736 @default.
• W4387617469 cites W1965608008 @default.
• W4387617469 cites W1991528957 @default.
• W4387617469 cites W2064284095 @default.
• W4387617469 cites W2065901967 @default.
• W4387617469 cites W2083383617 @default.
• W4387617469 cites W2103985627 @default.
• W4387617469 cites W2115589427 @default.
• W4387617469 cites W2117226423 @default.
• W4387617469 cites W2137653883 @default.
• W4387617469 cites W2161226285 @default.
• W4387617469 cites W2174409790 @default.
• W4387617469 cites W2176322034 @default.
• W4387617469 cites W2240814884 @default.
• W4387617469 cites W2592046007 @default.
• W4387617469 cites W2607867111 @default.
• W4387617469 cites W2620774153 @default.
• W4387617469 cites W2765549233 @default.
• W4387617469 cites W2891873695 @default.
• W4387617469 cites W2921785090 @default.
• W4387617469 cites W2950127069 @default.
• W4387617469 cites W3090361369 @default.
• W4387617469 cites W3096239448 @default.
• W4387617469 cites W3099932027 @default.
• W4387617469 cites W4213165341 @default.
• W4387617469 cites W4293179730 @default.
• W4387617469 doi "https://doi.org/10.1287/moor.2023.0012" @default.
• W4387617469 hasPublicationYear "2023" @default.
• W4387617469 type Work @default.
• W4387617469 citedByCount "0" @default.
• W4387617469 crossrefType "journal-article" @default.
• W4387617469 hasAuthorship W4387617469A5027137195 @default.
• W4387617469 hasAuthorship W4387617469A5033406324 @default.
• W4387617469 hasConcept C111919701 @default.
• W4387617469 hasConcept C11413529 @default.
• W4387617469 hasConcept C114614502 @default.
• W4387617469 hasConcept C121332964 @default.
• W4387617469 hasConcept C126255220 @default.
• W4387617469 hasConcept C1276947 @default.
• W4387617469 hasConcept C136625980 @default.
• W4387617469 hasConcept C13743678 @default.
• W4387617469 hasConcept C148764684 @default.
• W4387617469 hasConcept C151730666 @default.
• W4387617469 hasConcept C175859090 @default.
• W4387617469 hasConcept C199185054 @default.
• W4387617469 hasConcept C2524010 @default.
• W4387617469 hasConcept C2776036281 @default.
• W4387617469 hasConcept C2779343474 @default.
• W4387617469 hasConcept C33923547 @default.
• W4387617469 hasConcept C37404715 @default.
• W4387617469 hasConcept C41008148 @default.
• W4387617469 hasConcept C64331007 @default.
• W4387617469 hasConcept C86803240 @default.
• W4387617469 hasConceptScore W4387617469C111919701 @default.
• W4387617469 hasConceptScore W4387617469C11413529 @default.
• W4387617469 hasConceptScore W4387617469C114614502 @default.
• W4387617469 hasConceptScore W4387617469C121332964 @default.
• W4387617469 hasConceptScore W4387617469C126255220 @default.
• W4387617469 hasConceptScore W4387617469C1276947 @default.
• W4387617469 hasConceptScore W4387617469C136625980 @default.
• W4387617469 hasConceptScore W4387617469C13743678 @default.
• W4387617469 hasConceptScore W4387617469C148764684 @default.
• W4387617469 hasConceptScore W4387617469C151730666 @default.
• W4387617469 hasConceptScore W4387617469C175859090 @default.
• W4387617469 hasConceptScore W4387617469C199185054 @default.
• W4387617469 hasConceptScore W4387617469C2524010 @default.
• W4387617469 hasConceptScore W4387617469C2776036281 @default.
• W4387617469 hasConceptScore W4387617469C2779343474 @default.
• W4387617469 hasConceptScore W4387617469C33923547 @default.
• W4387617469 hasConceptScore W4387617469C37404715 @default.
• W4387617469 hasConceptScore W4387617469C41008148 @default.
• W4387617469 hasConceptScore W4387617469C64331007 @default.
• W4387617469 hasConceptScore W4387617469C86803240 @default.
• W4387617469 hasLocation W43876174691 @default.
• W4387617469 hasOpenAccess W4387617469 @default.
• W4387617469 hasPrimaryLocation W43876174691 @default.
• W4387617469 hasRelatedWork W2044443696 @default.
• W4387617469 hasRelatedWork W2099915933 @default.
• W4387617469 hasRelatedWork W2390742649 @default.
• W4387617469 hasRelatedWork W2418231958 @default.
• W4387617469 hasRelatedWork W2503538928 @default.
• W4387617469 hasRelatedWork W3099328339 @default.
• W4387617469 hasRelatedWork W3101281637 @default.
• W4387617469 hasRelatedWork W3116169590 @default.
• W4387617469 hasRelatedWork W4380840098 @default.
• W4387617469 hasRelatedWork W1703428550 @default.
• W4387617469 isParatext "false" @default.
• W4387617469 isRetracted "false" @default.
• W4387617469 workType "article" @default.