Sciweavers

SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
13 years 1 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
SWAT
2010
Springer
294views Algorithms» more  SWAT 2010»
13 years 1 months ago
Bin Packing with Fixed Number of Bins Revisited
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
Klaus Jansen, Stefan Kratsch, Dániel Marx, ...
SWAT
2010
Springer
203views Algorithms» more  SWAT 2010»
13 years 2 months ago
The MST of Symmetric Disk Graphs Is Light
A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matth...
SWAT
2010
Springer
207views Algorithms» more  SWAT 2010»
13 years 2 months ago
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput
David P. Bunde, Michael H. Goldwasser
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
13 years 2 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam
SWAT
2010
Springer
332views Algorithms» more  SWAT 2010»
13 years 7 months ago
Improved Methods For Generating Quasi-gray Codes
Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Mahe...
SWAT
2010
Springer
269views Algorithms» more  SWAT 2010»
13 years 8 months ago
Approximation Algorithms for Free-Label Maximization
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
Mark de Berg, Dirk H. P. Gerrits
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
13 years 8 months ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen
SWAT
2010
Springer
250views Algorithms» more  SWAT 2010»
13 years 8 months ago
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov...
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
13 years 8 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour