STACS
2007
Springer
14 years 6 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
STACS
2007
Springer
14 years 6 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
STACS
2007
Springer
14 years 6 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
STACS
2007
Springer
14 years 6 months ago
2007
Springer
: If you can round {0, 1 2} vectors nicely, then all rational vectors.
STACS
2007
Springer
14 years 6 months ago
2007
Springer
STACS
2007
Springer
14 years 6 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
STACS
2007
Springer
14 years 6 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
STACS
2007
Springer
14 years 6 months ago
2007
Springer
STACS
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
STACS
2007
Springer
14 years 6 months ago
2007
Springer
In holographic algorithms, symmetric signatures have been particularly useful. We give a complete characterization of these symmet