Sciweavers

Share
WADS
2007
Springer
195views Algorithms» more  WADS 2007»
9 years 8 months ago
Approximation Algorithms for the Sex-Equal Stable Marriage Problem
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
WADS
2007
Springer
91views Algorithms» more  WADS 2007»
9 years 8 months ago
Kernelization and Complexity Results for Connectivity Augmentation Problems
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
Jiong Guo, Johannes Uhlmann
WADS
2007
Springer
113views Algorithms» more  WADS 2007»
9 years 8 months ago
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans R...
WADS
2007
Springer
120views Algorithms» more  WADS 2007»
9 years 8 months ago
Branch and Recharge: Exact Algorithms for Generalized Domination
Fedor V. Fomin, Petr A. Golovach, Jan Kratochv&iac...
WADS
2007
Springer
189views Algorithms» more  WADS 2007»
9 years 8 months ago
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
Lukasz Kowalik, Marcin Mucha
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
9 years 8 months ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo
WADS
2007
Springer
114views Algorithms» more  WADS 2007»
9 years 8 months ago
Improved Algorithms for the Feedback Vertex Set Problems
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songji...
WADS
2007
Springer
121views Algorithms» more  WADS 2007»
9 years 8 months ago
Cauchy's Theorem and Edge Lengths of Convex Polyhedra
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
WADS
2007
Springer
99views Algorithms» more  WADS 2007»
9 years 8 months ago
Flooding Countries and Destroying Dams
Rodrigo I. Silveira, René van Oostrum
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
9 years 8 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
books