Sciweavers

46 search results - page 2 / 10
» On Approximating Restricted Cycle Covers
Sort
View
WADS
2005
Springer
187views Algorithms» more  WADS 2005»
14 years 2 months ago
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
Markus Bläser, L. Shankar Ram, Maxim Sviriden...
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
13 years 9 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey
IPCO
2010
160views Optimization» more  IPCO 2010»
13 years 10 months ago
On Column-Restricted and Priority Covering Integer Programs
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
Deeparnab Chakrabarty, Elyot Grant, Jochen Kö...
COMPGEOM
2003
ACM
14 years 2 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
FOCS
2009
IEEE
14 years 4 months ago
Decomposing Coverings and the Planar Sensor Cover Problem
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
Matt Gibson, Kasturi R. Varadarajan