Near-Linear Approximation Algorithms for Geometric Hitting Sets

Author： Agarwal Pankaj   Ezra Esther   Sharir Micha  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.63, Iss.1-2, 2012-06, pp. : 1-25

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

Approximation Algorithms for Connected Dominating Sets

By Guha S.   Khuller S.  

Algorithmica, Vol. 20, Iss. 4, 1998-04 ,pp. : 374-387

Springer Publishing Company

Access to resources Recommend Favorite

Parallelization of Pipelined Algorithms for Sets of Linear Banded Systems

By Povitsky A.  

Journal of Parallel and Distributed Computing, Vol. 59, Iss. 1, 1999-10 ,pp. : 68-97

Academic Press

Access to resources Recommend Favorite

Optimal Piecewise-Linear Approximation Algorithms for Complex Dependencies

By Bauman E. V.   Dorofeyuk A. A.   Kornilov G. V.  

Automation and Remote Control, Vol. 65, Iss. 10, 2004-10 ,pp. : 1667-1674

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

By Guruswami V.   Khanna S.   Rajaraman R.   Shepherd B.   Yannakakis M.  

Journal of Computer and System Sciences, Vol. 67, Iss. 3, 2003-11 ,pp. : 473-496

Elsevier

Access to resources Recommend Favorite

Geometric numerical algorithms

By Del Buono N.   Politi T.  

Future Generation Computer Systems, Vol. 19, Iss. 3, 2003-04 ,pp. : 327-329

Elsevier

Access to resources Recommend Favorite