1040 search results - page 54 / 208 » Rounding algorithms for covering problems |
133
Voted
FUN
2010
Springer
15 years 8 months ago
2010
Springer
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...
182
click to vote
DAM
2011
14 years 10 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
126
click to vote
SODA
2004
ACM
15 years 5 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 ...
138
Voted
CGF
2006
15 years 3 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
190
Voted
ICALP
2011
Springer
14 years 7 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 ...