120 search results - page 4 / 24 » Randomized Lower Bounds for Online Path Coloring |
146
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
116
Voted
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
131
Voted
ISTCS
1993
Springer
15 years 7 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
129
Voted
JCSS
2006
15 years 3 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
138
Voted
DM
2010
15 years 3 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...