An (n log n) algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions

Publisher： Taylor & Francis Ltd

E-ISSN： 1029-4945|64|3|595-602

ISSN： 0233-1934

Source： Optimization, Vol.64, Iss.3, 2015-03, pp. : 595-602

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

An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs

By Bhattacharya B.K.   Kaller D.  

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 336-358

Academic Press

Access to resources Recommend Favorite

An in-place heapsort algorithm requiring n log n + n log* n −0.546871 n comparisons

By Hasan Md. Mahbubul  

International Journal of Computer Mathematics, Vol. 88, Iss. 16, 2011-11 ,pp. : 3350-3360

Taylor & Francis Ltd

Access to resources Recommend Favorite

An inverse approach to convex ordered median problems in trees

By Gassner Elisabeth  

Journal of Combinatorial Optimization, Vol. 23, Iss. 2, 2012-02 ,pp. : 261-273

Springer Publishing Company

Access to resources Recommend Favorite

Algorithm for the Cost Edge-Coloring of Trees

By Zhou Xiao   Nishizeki Takao  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 97-108

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Cut Algorithm for the Median-Path Problem

By Avella Pasquale   Boccia Maurizio   Sforza Antonio   Vasil'Ev Igor  

Computational Optimization and Applications, Vol. 32, Iss. 3, 2005-12 ,pp. : 215-230

Springer Publishing Company

Access to resources Recommend Favorite