1672 search results - page 54 / 335 » Tightness problems in the plane |
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
TRANSCI
2008
13 years 8 months ago
2008
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
AAIM
2007
Springer
14 years 3 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
CCCG
2003
13 years 10 months ago
2003
We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is rela...
EOR
2008
13 years 8 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...