Sciweavers

3875 search results - page 66 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
JCO
2007
149views more  JCO 2007»
14 years 9 months ago
A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
The 2-interval pattern problem over its various models and restrictions was proposed by Vialette (2004) for the application of RNA secondary structure prediction. We present an O(n...
Minghui Jiang
CP
2005
Springer
15 years 3 months ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
14 years 10 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
TACAS
2010
Springer
251views Algorithms» more  TACAS 2010»
15 years 2 months ago
Approximating the Pareto Front of Multi-criteria Optimization Problems
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
Julien Legriel, Colas Le Guernic, Scott Cotton, Od...
SIAMDM
2000
159views more  SIAMDM 2000»
14 years 9 months ago
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
Lisa Fleischer