Improved algorithms for resource allocation under varying capacity
We consider the problem of scheduling a set of jobs on a system that offers certain resource,
wherein the amount of resource offered varies over time. For each job, the input specifies a …
wherein the amount of resource offered varies over time. For each job, the input specifies a …
Approximation algorithms for the unsplittable flow problem on paths and trees
Abstract We study the Unsplittable Flow Problem (UFP) and related variants, namely UFP
with Bag Constraints and UFP with Rounds, on paths and trees. We provide improved …
with Bag Constraints and UFP with Rounds, on paths and trees. We provide improved …
Approximation algorithms for covering and packing problems on paths
A Pal - arXiv preprint arXiv:1402.1107, 2014 - arxiv.org
Routing and scheduling problems are fundamental problems in combinatorial optimization,
and also have many applications. Most variations of these problems are NP-Hard, so we …
and also have many applications. Most variations of these problems are NP-Hard, so we …
Improved algorithms for resource allocation under varying capacity
We consider the problem of scheduling a set of jobs on a system that offers certain resource,
wherein the amount of resource offered varies over time. For each job, the input specifies a …
wherein the amount of resource offered varies over time. For each job, the input specifies a …
Distributed algorithms for scheduling on line and tree networks with non-uniform bandwidths
VT Chakaravarthy, AR Choudhury… - 2013 IEEE 27th …, 2013 - ieeexplore.ieee.org
In this paper we study the unsplittable flow problem (UFP) on tree networks in a distributed
setting. We have a set of processors (or agents) and a set of tree networks defined over …
setting. We have a set of processors (or agents) and a set of tree networks defined over …
Approximation Algorithms for Rectangle Packing Problems (PhD Thesis)
S Ingala - arXiv preprint arXiv:1711.07851, 2017 - arxiv.org
In rectangle packing problems we are given the task of placing axis-aligned rectangles in a
given plane region, so that they do not overlap with each other. In Maximum Weight …
given plane region, so that they do not overlap with each other. In Maximum Weight …
[PDF][PDF] Approximation Algorithms for Network Design Problems
S Uniyal - 2017 - people.idsia.ch
There are lots of natural real-life problems that can be modelled as discrete optimization
problems. Unfortunately, many of them are hard to solve efficiently. An approximation …
problems. Unfortunately, many of them are hard to solve efficiently. An approximation …
Scheduling resources for throughput maximization
We consider the problem of scheduling a set of resources over time. Each resource is
specified by a set of time intervals (and the associated amount of resource available), and …
specified by a set of time intervals (and the associated amount of resource available), and …