7129 search results - page 86 / 1426 » Approximation Algorithms for Treewidth |
123
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
143
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
104
click to vote
EVOW
1999
Springer
15 years 7 months ago
1999
Springer
This paper describes a new approximate approach for checking the correctness of the implementation of a protocol interface, comparing its lowlevel implementation with its high-leve...
133
click to vote
JGAA
2000
15 years 2 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
146
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...