Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10971| Title: | An O(n log n) version of the Averbakh-Berman algorithm for the robust median of a tree |
| Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής |
| Keywords: | minmax regret,tree median,robust optimization,set union,location,network |
| URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/10971 |
| ISSN: | 0167-6377 |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| georgiadis-2008-An O(n log n) Version of the Averbakh-Berman.pdf | 129.25 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
