Approximation Algorithms for k-hurdle Problems

Author： Dean Brian   Griffis Adam   Parekh Ojas   Whitley Adam  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.59, Iss.1, 2011-01, pp. : 81-93

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Iterative approximation of k-limited polling systems

By Vuuren M.   Winands E.  

Queueing Systems, Vol. 55, Iss. 3, 2007-03 ,pp. : 161-178

Springer Publishing Company

Access to resources Recommend Favorite

Stopping rules in k-adaptive global random search algorithms

By Zhigljavsky Anatoly   Hamilton Emily  

Journal of Global Optimization, Vol. 48, Iss. 1, 2010-09 ,pp. : 87-97

Springer Publishing Company

Access to resources Recommend Favorite

Bicriteria approximation algorithms for scheduling problems with communications delays

By Bampis Evripidis   Kononov Alexander  

Journal of Scheduling, Vol. 8, Iss. 4, 2005-07 ,pp. : 281-294

Springer Publishing Company

Access to resources Recommend Favorite

Outer approximation algorithms for canonical DC problems

By Bigi Giancarlo   Frangioni Antonio   Zhang Qinghua  

Journal of Global Optimization, Vol. 46, Iss. 2, 2010-02 ,pp. : 163-189

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Quickest Spanning Tree Problems

By Hassin Refael   Levin Asaf  

Algorithmica, Vol. 41, Iss. 1, 2004-10 ,pp. : 43-52

Springer Publishing Company

Access to resources Recommend Favorite