STACS
2010
Springer
13 years 11 months ago
2010
Springer
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
STACS
2010
Springer
13 years 11 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...