7006 search results - page 37 / 1402 » Approximation Algorithms |
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
WINE
2007
Springer
14 years 2 months ago
2007
Springer
We consider a crucial aspect of displaying advertisements on the internet: the individual user. In particular, we consider ad fatigue, where a user tires of an advertisement as it ...
WG
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
TCBB
2008
13 years 8 months ago
2008
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...