Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
STACS
2010
Springer
11 years 9 months ago
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model
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...
Leah Epstein, Asaf Levin, Julián Mestre, Da...
STACS
2010
Springer
12 years 3 months ago
The Complexity of the List Homomorphism Problem for Graphs
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...
László Egri, Andrei A. Krokhin, Beno...
STACS
2010
Springer
12 years 4 months ago
Decidability of the Interval Temporal Logic ABB over the Natural Numbers
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...
Angelo Montanari, Pietro Sala, Guido Sciavicco
STACS
2010
Springer
12 years 4 months ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
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 ...
Neelesh Khanna, Surender Baswana
STACS
2010
Springer
12 years 4 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
STACS
2010
Springer
12 years 6 months ago
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses
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...
Xiaoyang Gu, John M. Hitchcock, Aduri Pavan
STACS
2010
Springer
12 years 6 months ago
On Iterated Dominance, Matrix Elimination, and Matched Paths
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...
Felix Brandt, Felix A. Fischer, Markus Holzer
STACS
2010
Springer
12 years 6 months ago
Construction Sequences and Certifying 3-Connectedness
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...
Jens M. Schmidt
STACS
2010
Springer
12 years 6 months ago
Optimal Query Complexity for Reconstructing Hypergraphs
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...
Nader H. Bshouty, Hanna Mazzawi
STACS
2010
Springer
12 years 6 months ago
The Traveling Salesman Problem under Squared Euclidean Distances
The Traveling Salesman Problem Under Squared Euclidean Distances
Fred van Nijnatten, René Sitters, Gerhard J...
books