1672 search results - page 3 / 335 » Tightness problems in the plane |
CPAIOR
2010
Springer
13 years 10 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
The floodlight illumination problem asks whether there exists a one-to-one placement of n floodlights illuminating infinite wedges of angles 1, . . . , n at n sites p1, . . . , pn...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
MST
2011
13 years 2 months ago
2011
Abstract. We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman ...
TCBB
2008
13 years 7 months ago
2008
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...