Moderately exponential time and fixed parameter approximation algorithms

Author： Escoffier Bruno   Paschos Vangelis Th.   Tourniaire Emeric  

Publisher： Taylor & Francis Ltd

ISSN： 0233-1934

Source： Optimization, Vol.62, Iss.8, 2013-08, pp. : 1019-1036

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

Abstract

Related content

On efficient fixed-parameter algorithms for weighted vertex cover

By Niedermeier R.   Rossmanith P.  

Journal of Algorithms, Vol. 47, Iss. 2, 2003-07 ,pp. : 63-77

Elsevier

Access to resources Recommend Favorite

Approximation Algorithms for Time Constrained Scheduling

By Jansen K.   Ohring S.  

Information and Computation, Vol. 132, Iss. 2, 1997-02 ,pp. : 85-108

Academic Press

Access to resources Recommend Favorite

On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension

By Chazelle B.   Matousek J.  

Journal of Algorithms, Vol. 21, Iss. 3, 1996-11 ,pp. : 579-597

Academic Press

Access to resources Recommend Favorite

Orders of approximation by local exponential splines

By Volkov Yu.   Pytkeev E.   Shevaldin V.  

Proceedings of the Steklov Institute of Mathematics, Vol. 284, Iss. 1, 2014-04 ,pp. : 175-184

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Approximation Algorithms in Batch Processing

By Deng Xiaotie   Poon Chung Keung   Zhang Yuzhong  

Journal of Combinatorial Optimization, Vol. 7, Iss. 3, 2003-09 ,pp. : 247-257

Springer Publishing Company

Access to resources Recommend Favorite