26 search results - page 3 / 6 » Crown reductions for the Minimum Weighted Vertex Cover probl... |
107
click to vote
ESA
2007
Springer
15 years 5 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...
WG
2004
Springer
15 years 4 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
125
click to vote
FOCS
2003
IEEE
15 years 4 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 ...
102
click to vote
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
SODA
2004
ACM
15 years 17 days ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...