Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

Author： Gaur D.R.   Ibaraki T.   Krishnamurti R.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.43, Iss.1, 2002-04, pp. : 138-152

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

Exact and approximation algorithms for a soft rectangle packing problem

By Fügenschuh Armin   Junosza-Szaniawski Konstanty   Lonc Zbigniew  

Optimization, Vol. 63, Iss. 11, 2014-11 ,pp. : 1637-1663

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximation Algorithms for the Class Cover Problem

By Cannon Adam H.  

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 215-223

Springer Publishing Company

Access to resources Recommend Favorite

Approximation algorithms for the stochastic priority facility location problem

By Li Gaidi   Wang Zhen   Wu Chenchen  

Optimization, Vol. 62, Iss. 7, 2013-07 ,pp. : 919-928

Taylor & Francis Ltd

Access to resources Recommend Favorite

An improved approximation ratio for the minimum latency problem

By Goemans M.   Kleinberg J.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 111-124

Elsevier

Access to resources Recommend Favorite

Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks

By Oliveira C.   Pardalos P.  

Cybernetics and Systems Analysis, Vol. 41, Iss. 6, 2005-11 ,pp. : 898-908

Springer Publishing Company

Access to resources Recommend Favorite