An O(n( n)^2/ n) algorithm for the single maximum coverage location or the (1,X_p)-medianoid problem on trees

DOI10.1016/J.IPL.2008.12.009zbMATH Open1191.68472OpenAlexW2080033794MaRDI QIDQ976129FDOQ976129

H.-C. Wirth, Joachim Spoerhase

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.009

zbMATH Keywords

treegraph algorithmscoverageefficient algorithmmedianoid

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The budgeted maximum coverage problem
• The Maximum Coverage Location Problem
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Mixed covering of trees and the augmentation problem with odd diameter constraints
• Title not available (Why is that?)

Cited In (3)

• Improved algorithms for some competitive location centroid problems on paths, trees and graphs
• \((r,p)\)-centroid problems on paths and trees
• On planar medianoid competitive location problems with Manhattan distance

   Recommendations

• An optimal algorithm for single maximum coverage location on trees and related problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Maximal covering tree problems 👍 👎
• A linear time algorithm for computing minmax regret 1-median on a tree network 👍 👎
• Efficient algorithms for the conditional covering problem 👍 👎

This page was built for publication: An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976129)