15 search results - page 2 / 3 » The Weighted Spanning Tree Constraint Revisited |
LATIN
2010
Springer
14 years 6 days ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
JOIN
2007
13 years 5 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
ESA
2009
Springer
13 years 12 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
PR
2007
13 years 4 months ago
2007
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...