SOFSEM
2010
Springer
14 years 7 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
SOFSEM
2010
Springer
14 years 7 months ago
2010
Springer
STACS
2010
Springer
14 years 7 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
STACS
2010
Springer
14 years 7 months ago
2010
Springer
Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...
STACS
2010
Springer
14 years 7 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
STACS
2010
Springer
14 years 7 months ago
2010
Springer
The Traveling Salesman Problem Under Squared Euclidean Distances
STACS
2010
Springer
14 years 7 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
STACS
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
STACS
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
STACS
2010
Springer
14 years 7 months ago
2010
Springer
