A Note on the Robust 1-Center Problem on Trees

Rainer Burkard () and Helidon Dollani ()

Annals of Operations Research, 2002, vol. 110, issue 1, 69-82

Abstract: We consider the robust 1-center problem on trees with uncertainty in vertex weights and edge lengths. The weights of the vertices and the lengths of the edges can take any value in prespecified intervals with unknown distribution. We show that this problem can be solved in O(n 3 log n) time thus improving on Averbakh and Berman's algorithm with time complexity O(n 6 ). For the case when the vertices of the tree have weights equal to 1 we show that the robust 1-center problem can be solved in O(nlog n) time, again improving on Averbakh and Berman's time complexity of O(n 2 log n). Copyright Kluwer Academic Publishers 2002

Keywords: location problems; robust optimization; center problem (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1020711416254 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:110:y:2002:i:1:p:69-82:10.1023/a:1020711416254

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1020711416254

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().