40 search results - page 1 / 8 » Lower Bounds for On-Line Graph Coloring |
SODA
1992
ACM
13 years 6 months ago
1992
ACM
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
COMPGEOM
1992
ACM
13 years 9 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
INFOCOM
2000
IEEE
13 years 9 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....