Sciweavers

626 search results - page 7 / 126
» On Approximability of Minimum Bisection Problem
Sort
View
CATS
2006
13 years 8 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
IPL
2007
70views more  IPL 2007»
13 years 7 months ago
An improved approximation ratio for the minimum linear arrangement problem
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
Uriel Feige, James R. Lee
JCDCG
2004
Springer
14 years 21 days ago
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
Marc Benkert, Alexander Wolff, Florian Widmann