Resource allocation with time intervals
type: Item
instance of: scholarly article
title: Resource allocation with time intervals
zbMATH Open document ID: 1208.90058
author: Andreas Darmann
author: Ulrich Pferschy
author: Joachim Schauer
published in: Theoretical Computer Science
publication date: 2010-11-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5817528
zbMATH Keywords: resource allocation
zbMATH Keywords: proper intervals
zbMATH Keywords: interval scheduling
zbMATH Keywords: unsplittable flow
zbMATH Keywords: approximation algorithm
Wikidata QID: Q61638327
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.08.028
OpenAlex ID: W2040756373
cites work: Scheduling jobs with fixed start and end times
cites work: A quasi-PTAS for unsplittable flow on line graphs
cites work: Q4633882
cites work: A unified approach to approximating resource allocation and scheduling
cites work: The Temporal Knapsack Problem and Its Solution
cites work: Q4288578
cites work: Interval scheduling on identical machines
cites work: Q4737541
cites work: Approximation algorithms for the unsplittable flow problem
cites work: Q3374865
cites work: On the complexity of adjacent resource scheduling
cites work: The Fixed Job Schedule Problem with Working-Time Constraints
cites work: Q4198056
cites work: Algorithmic graph theory and perfect graphs
cites work: Maximizing the value of a space mission
cites work: The clique-separator graph for chordal graphs
cites work: Q4821303
cites work: Interval scheduling: A survey
cites work: Q4472463
cites work: Off-line admission control for general scheduling problems
DOI: 10.1016/J.TCS.2010.08.028
description: scientific article; zbMATH DE number 5817528