Sciweavers

7006 search results - page 36 / 1402
» Approximation Algorithms
Sort
View
DATE
2008
IEEE
93views Hardware» more  DATE 2008»
14 years 2 months ago
A Fast Approximation Algorithm for MIN-ONE SAT
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The ...
Lei Fang, Michael S. Hsiao
SWAT
2010
Springer
269views Algorithms» more  SWAT 2010»
14 years 1 months ago
Approximation Algorithms for Free-Label Maximization
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
Mark de Berg, Dirk H. P. Gerrits
NETWORKS
2002
13 years 8 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 9 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 8 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram