Search Results - subject:"Approximation algorithms"

Did you mean: subject:"Approximation algorithm" (11,330 results)

Approximation algorithm for a class of global optimization problems

Locatelli, Marco - In: Journal of Global Optimization 55 (2013) 1, pp. 13-25

In this paper we develop and derive the computational cost of an <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\varepsilon}$$</EquationSource> </InlineEquation> -approximation algorithm for a class of global optimization problems, where a suitably defined composition of some ratio functions is minimized over a convex set. The result extends a previous one about a class...</equationsource></inlineequation>

Persistent link: https://www.econbiz.de/10010994132

An LP-based 2/3-approximation algorithm for the s-t path graph traveling salesman problem

Gao, Zhihan - In: Operations research letters 41 (2013) 6, pp. 615-617

Persistent link: https://www.econbiz.de/10010236087

Routing vehicles to minimize fuel consumption

Gaur, Daya Ram; Mudgal, Apurva; Singh, Rishi Ranjan - In: Operations research letters 41 (2013) 6, pp. 576-580

Persistent link: https://www.econbiz.de/10010236173

Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints

Carrasco, Rodrigo A.; Iyengar, Garud; Stein, Cliff - In: Operations research letters 41 (2013) 5, pp. 436-441

Persistent link: https://www.econbiz.de/10010189892

On multiprocessor temperature-aware scheduling problems

Bampis, Evripidis; Letsios, Dimitrios; Lucarelli, Giorgio; … - In: Journal of scheduling 16 (2013) 5, pp. 529-538

Persistent link: https://www.econbiz.de/10010196449

Non-preemptive speed scaling

Antoniadis, Antonios; Huang, Chien-chung - In: Journal of scheduling 16 (2013) 4, pp. 385-394

Persistent link: https://www.econbiz.de/10009777788

Tight approximation bounds for combinatorial frugal coverage algorithms

Caragiannis, Ioannis; Kaklamanis, Christos; Kyropoulou, … - In: Journal of combinatorial optimization 26 (2013) 2, pp. 292-309

Persistent link: https://www.econbiz.de/10009778598

Approximations for monotone and nonmonotone submodular maximization with Knapsack constraints

Kulik, Ariel; Shachnai, Hadas; Tamir, Tami - In: Mathematics of operations research 38 (2013) 4, pp. 729-739

Persistent link: https://www.econbiz.de/10010210721

An approximation algorithm for the bipartite traveling tournament problem

Hoshino, Richard; Kawarabayashi, Ken-ichi - In: Mathematics of operations research 38 (2013) 4, pp. 720-728

Persistent link: https://www.econbiz.de/10010210740

Parameterized complexity of k-anonymity: hardness and tractability

Bonizzoni, Paola; Vedova, Gianluca Della; Dondi, Riccardo; … - In: Journal of combinatorial optimization 26 (2013) 1, pp. 19-43

Persistent link: https://www.econbiz.de/10009757309