4255 search results - page 40 / 851 » Cover |
ICALP
2004
Springer
14 years 28 days ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
STOC
1999
ACM
13 years 12 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
DAM
2008
13 years 7 months ago
2008
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...
DM
2008
13 years 7 months ago
2008
We find the largest for which any simple closed path in the universal cover R2 \ Z2 of R2 \ Z2, equipped with the natural lifted metric from the Euclidean two dimensional plane,...
DM
2006
13 years 7 months ago
2006
In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spann...