7930 search results - page 329 / 1586 » Greedy in Approximation Algorithms |
197
click to vote
CCE
2005
15 years 6 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
194
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
175
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
179
click to vote
PPAM
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
179
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...