Improved algorithms for resource allocation under varying capacity
type: Item
instance of: scholarly article
title: Improved algorithms for resource allocation under varying capacity
zbMATH Open document ID: 1406.90036
author: Venkatesan T. Chakaravarthy
author: Anamitra R. Choudhury
author: Shalmoli Gupta
author: Sambudha Roy
author: Yogish Sabharwal
published in: Journal of Scheduling
publication date: 2018-11-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6974905
zbMATH Keywords: unsplittable flow problem
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s10951-017-0515-3
OpenAlex ID: W2588949834
cites work: Submodular Unsplittable Flow on Trees
cites work: Label placement by maximum independent set in rectangles
cites work: Q4459826
cites work: Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path
cites work: A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
cites work: A quasi-PTAS for unsplittable flow on line graphs
cites work: A logarithmic approximation for unsplittable flow on line graphs
cites work: A unified approach to approximating resource allocation and scheduling
cites work: Approximating the throughput of multiple machines in real-time scheduling
cites work: Multi-phase algorithms for throughput maximization for real-time scheduling
cites work: A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
cites work: Q4737541
cites work: A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints
cites work: Distributed algorithms for scheduling on line and tree networks
cites work: Approximation algorithms for the unsplittable flow problem
cites work: Q4633902
cites work: Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
cites work: Multicommodity demand flow in a tree and packing integer programs
cites work: Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
cites work: Interval selection: Applications, algorithms, and lower bounds
cites work: Optimal packing and covering in the plane are NP-complete
cites work: Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows
cites work: Q4250205
cites work: Fast primal-dual distributed algorithms for scheduling and matching problems
cites work: On the approximability of an interval scheduling problem
cites work: Elimination graphs
DOI: 10.1007/S10951-017-0515-3
description: scientific article; zbMATH DE number 6974905