STACS
2007
Springer
13 years 10 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
STACS
2007
Springer
13 years 10 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. Performances of an MDP are evaluated by a payoff function. The controller of ...
STACS
2007
Springer
13 years 10 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
13 years 10 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
13 years 10 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
13 years 10 months ago
2007
Springer
: If you can round {0, 1 2} vectors nicely, then all rational vectors.
STACS
2007
Springer
13 years 10 months ago
2007
Springer
STACS
2007
Springer
13 years 10 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...