Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs

Author： Lazar Avivit  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.66, Iss.3, 2013-07, pp. : 615-640

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

The location of median paths on grid graphs

By Becker Ronald  

Annals of Operations Research, Vol. 150, Iss. 1, 2007-03 ,pp. : 65-78

Springer Publishing Company

Access to resources Recommend Favorite

Improved shortest path algorithms for nearly acyclic graphs

By Saunders S.   Takaoka T.  

Theoretical Computer Science, Vol. 293, Iss. 3, 2003-02 ,pp. : 535-556

Elsevier

Access to resources Recommend Favorite

Improved Algorithms and Complexity Results for Power Domination in Graphs

By Guo Jiong   Niedermeier Rolf   Raible Daniel  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 177-202

Springer Publishing Company

Access to resources Recommend Favorite

Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

By Nikolopoulos S.D.  

Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. : 48-67

Elsevier

Access to resources Recommend Favorite

Optimal parallel algorithms for path problems on planar graphs

By Srikrishna G.   Rangan C.P.  

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 27-43

Elsevier

Access to resources Recommend Favorite