6 search results - page 1 / 2 » Treewidth Reduction for Constrained Separation and Bipartiza... |
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
TSP
2010
12 years 11 months ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
LATIN
2010
Springer
13 years 11 months 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...
DAGM
2003
Springer
13 years 10 months ago
2003
Springer
We present an approach for estimating the relative transformations between fragments of a broken cylindrical structure in 3d. To solve this problem, we first measure the orientatio...
ECRTS
2004
IEEE
13 years 8 months ago
2004
IEEE
In this paper, we explore the feasibility and performance optimization problems for real-time systems that must remain functional during an operation/mission with a fixed, initial...