Matches in SemOpenAlex for { <https://semopenalex.org/work/W2569345830> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W2569345830 endingPage "2422" @default.
- W2569345830 startingPage "2411" @default.
- W2569345830 abstract "In the Unsplittable Flow on a Path problem (UFP) we are given a path with non-negative edge capacities and a set of tasks, each one characterized by a subpath, a demand, and a profit. Our goal is to select a subset of tasks of maximum total profit so that the total demand of the selected tasks on each edge does not exceed the respective edge capacity. UFP naturally captures several applications in bandwidth allocation, job scheduling, and caching.Following a sequence of improvements, the current best (polynomial time) approximation factor for UFP is 2 + e [Anagnostopoulos et al. SODA'14]. UFP also admits a QPTAS [Bansal et al. STOC'06, Batra et al. SODA'15], and finding a PTAS is considered a challenging open problem.In this paper we make progress in the direction of the mentioned open problem. Informally, we introduce a technique to obtain real PTASs from PTASs with resource augmentation where edge capacities can be violated by a 1 + e factor. While unfortunately we do not have a resource-augmentation PTAS for the general case of UFP, for many relevant special cases we have such an algorithm or we provide one in this paper. For example, our approach leads to a PTAS for the rooted case of UFP, where all tasks share a common edge. This is one of the simplest natural restrictions of UFP where the best-known approximation was 2 + e (like for the general case).At a high level, our technique is to sacrifice a few tasks in the optimal solution (with a small loss of profit) in order to create a sufficient amount of slack capacity on each edge. This slack turns out to be large enough to substitute the additional capacity we would gain from resource augmentation. Crucial for our approach is that we obtain slack from tasks with relatively small and relatively large demand simultaneously. In all prior polynomial time approximation algorithms the sacrificed tasks came from only one of these two groups." @default.
- W2569345830 created "2017-01-13" @default.
- W2569345830 creator A5034276567 @default.
- W2569345830 creator A5041355842 @default.
- W2569345830 creator A5051938451 @default.
- W2569345830 creator A5067503013 @default.
- W2569345830 date "2017-01-16" @default.
- W2569345830 modified "2023-09-23" @default.
- W2569345830 title "To augment or not to augment: solving unsplittable flow on a path by creating slack" @default.
- W2569345830 cites W2003902046 @default.
- W2569345830 doi "https://doi.org/10.5555/3039686.3039845" @default.
- W2569345830 hasPublicationYear "2017" @default.
- W2569345830 type Work @default.
- W2569345830 sameAs 2569345830 @default.
- W2569345830 citedByCount "3" @default.
- W2569345830 countsByYear W25693458302017 @default.
- W2569345830 countsByYear W25693458302019 @default.
- W2569345830 crossrefType "proceedings-article" @default.
- W2569345830 hasAuthorship W2569345830A5034276567 @default.
- W2569345830 hasAuthorship W2569345830A5041355842 @default.
- W2569345830 hasAuthorship W2569345830A5051938451 @default.
- W2569345830 hasAuthorship W2569345830A5067503013 @default.
- W2569345830 hasConcept C11413529 @default.
- W2569345830 hasConcept C126255220 @default.
- W2569345830 hasConcept C148764684 @default.
- W2569345830 hasConcept C206729178 @default.
- W2569345830 hasConcept C311688 @default.
- W2569345830 hasConcept C33923547 @default.
- W2569345830 hasConcept C41008148 @default.
- W2569345830 hasConceptScore W2569345830C11413529 @default.
- W2569345830 hasConceptScore W2569345830C126255220 @default.
- W2569345830 hasConceptScore W2569345830C148764684 @default.
- W2569345830 hasConceptScore W2569345830C206729178 @default.
- W2569345830 hasConceptScore W2569345830C311688 @default.
- W2569345830 hasConceptScore W2569345830C33923547 @default.
- W2569345830 hasConceptScore W2569345830C41008148 @default.
- W2569345830 hasLocation W25693458301 @default.
- W2569345830 hasOpenAccess W2569345830 @default.
- W2569345830 hasPrimaryLocation W25693458301 @default.
- W2569345830 hasRelatedWork W1554636509 @default.
- W2569345830 hasRelatedWork W1571851418 @default.
- W2569345830 hasRelatedWork W171146128 @default.
- W2569345830 hasRelatedWork W1712818156 @default.
- W2569345830 hasRelatedWork W174940708 @default.
- W2569345830 hasRelatedWork W2129486506 @default.
- W2569345830 hasRelatedWork W2408646906 @default.
- W2569345830 hasRelatedWork W2739825302 @default.
- W2569345830 hasRelatedWork W2950384157 @default.
- W2569345830 hasRelatedWork W2950616217 @default.
- W2569345830 hasRelatedWork W2952115575 @default.
- W2569345830 hasRelatedWork W2990452837 @default.
- W2569345830 hasRelatedWork W2998654019 @default.
- W2569345830 hasRelatedWork W3013590336 @default.
- W2569345830 hasRelatedWork W3014052784 @default.
- W2569345830 hasRelatedWork W3041498984 @default.
- W2569345830 hasRelatedWork W3208261261 @default.
- W2569345830 hasRelatedWork W3209212021 @default.
- W2569345830 hasRelatedWork W3210636733 @default.
- W2569345830 hasRelatedWork W2378425369 @default.
- W2569345830 isParatext "false" @default.
- W2569345830 isRetracted "false" @default.
- W2569345830 magId "2569345830" @default.
- W2569345830 workType "article" @default.