4843 search results - page 125 / 969 » The Shortcut Problem - Complexity and Approximation |
81
Voted
WADS
2005
Springer
15 years 3 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
98
Voted
MP
2010
14 years 8 months ago
2010
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
79
Voted
ECCC
2000
14 years 10 months ago
2000
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio ...
COR
2007
14 years 10 months ago
2007
This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The obje...
112
click to vote
IPL
2000
14 years 10 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...