40 search results - page 1 / 8 » Exact Algorithms for a Geometric Packing Problem (Extended A... |
STACS
1993
Springer
14 years 3 months ago
1993
Springer
ESA
2005
Springer
14 years 4 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
COMGEO
2010
ACM
13 years 11 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
WADS
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
ISAAC
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...