24 search results - page 3 / 5 » Minimum-Weight Cycle Covers and Their Approximability |
136
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
151
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
110
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
170
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
116
click to vote
ICCAD
2001
IEEE
15 years 10 months ago
2001
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...