Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2008, Volume 15, Issue 4, Pages 84–91 (Mi da543)  

This article is cited in 1 scientific paper (total in 1 paper)

An approximation algorithm for the hierarchical median problem

V. V. Shenmaier

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Abstract: The hierarchical median problem asks for an hierarchical sequence of solutions of the $k$-median problem for the increasing values of $k$. The best known algorithm for this problem has competitive ratio 20.71. The cases, when all the clients and facilities lie on the path and in Euclidean metric space, are considered. The result is the algorithm with the respective competitive ratio 8 and 8+4$\sqrt2$ (approximately 13.66). Bibl. 6.

Keywords: $k$-median problem, hierarchical clustering, incremental median problem, approximation algorithm, competitive ratio.

Full text: PDF file (230 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2009, 3:1, 128–132

Bibliographic databases:

UDC: 519.176
Received: 18.12.2007
Revised: 11.07.2008

Citation: V. V. Shenmaier, “An approximation algorithm for the hierarchical median problem”, Diskretn. Anal. Issled. Oper., 15:4 (2008), 84–91; J. Appl. Industr. Math., 3:1 (2009), 128–132

Citation in format AMSBIB
\Bibitem{She08}
\by V.~V.~Shenmaier
\paper An approximation algorithm for the hierarchical median problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2008
\vol 15
\issue 4
\pages 84--91
\mathnet{http://mi.mathnet.ru/da543}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2543602}
\zmath{https://zbmath.org/?q=an:1249.90223}
\transl
\jour J. Appl. Industr. Math.
\yr 2009
\vol 3
\issue 1
\pages 128--132
\crossref{https://doi.org/10.1134/S1990478909010141}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-63349099203}


Linking options:
  • http://mi.mathnet.ru/eng/da543
  • http://mi.mathnet.ru/eng/da/v15/i4/p84

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Dai WenQiang, “A 16-Competitive Algorithm for Hierarchical Median Problem”, Sci. China-Inf. Sci., 57:3 (2014), 032113  crossref  zmath  isi  elib  scopus
  • ƒискретный анализ и исследование операций
    Number of views:
    This page:488
    Full text:139
    References:25
    First page:5

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021