1272 search results - page 33 / 255 » The Set Cover with Pairs Problem |
104
click to vote
SODA
2004
ACM
15 years 2 months 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 ...
165
click to vote
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
103
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
91
Voted
SWAT
2004
Springer
15 years 6 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
119
Voted
NETWORKS
2007
15 years 5 days ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...