1672 search results - page 102 / 335 » Tightness problems in the plane |
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
IPCO
2007
13 years 10 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
CCO
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
ICCV
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper considers the problem of self-calibration of a camera from an image sequence in the case where the camera's internal parameters (most notably focal length) may cha...
CCCG
2007
13 years 10 months ago
2007
We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid graph has a vertex set that is a subset of the grid ...