112
click to vote
STACS
15 years 7 months ago
2009 Springer 
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
111
Voted
STACS
15 years 7 months ago
2009 Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
103
Voted
STACS
15 years 7 months ago
2009 Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
102
Voted
STACS
15 years 7 months ago
2009 Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
104
click to vote
STACS
15 years 7 months ago
2009 Springer 
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
|
Theoretical Computer Science