Sciweavers

216 search results - page 16 / 44
» Covering Problems with Hard Capacities
Sort
View
SIGMETRICS
2006
ACM
128views Hardware» more  SIGMETRICS 2006»
14 years 1 months ago
GPS scheduling: selection of optimal weights and comparison with strict priorities
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...
Pascal Lieshout, Michel Mandjes, Sem C. Borst
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
14 years 4 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu
FSTTCS
2004
Springer
14 years 28 days ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 7 months ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
Esther M. Arkin, Michael A. Bender, Sándor ...
FSTTCS
2010
Springer
13 years 5 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang