626 search results - page 46 / 126 » On Approximability of Minimum Bisection Problem |
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2log1−ǫ (n) -inapproximability re...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
PDCAT
2005
Springer
14 years 2 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
ALENEX
2001
13 years 10 months ago
2001
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...