STACS

2010

Springer

13 years 6 months ago
2010

Springer

ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...

STACS

2010

Springer

14 years 29 days ago
2010

Springer

We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...

STACS

2010

Springer

14 years 2 months ago
2010

Springer

In this paper, we focus our attention on the interval temporal logic of the Allen’s relations “meets”, “begins”, and “begun by” (ABB for short), interpreted over natu...

STACS

2010

Springer

14 years 2 months ago
2010

Springer

Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...

STACS

2010

Springer

14 years 2 months ago
2010

Springer

Abstract. In the constraint satisfaction problem (CSP), the aim is to ﬁnd an assignment of values to a set of variables subject to speciﬁed constraints. In the minimum cost hom...

STACS

2010

Springer

14 years 3 months ago
2010

Springer

This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...

STACS

2010

Springer

14 years 4 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 4 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 4 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 4 months ago
2010

Springer

The Traveling Salesman Problem Under Squared Euclidean Distances