Online minimum spanning tree with advice

Extended Abstract
Download
Text (Adobe PDF, 413.1Kb)
Thumbnail
Open access
Author
Bianchi, Maria P.
Böckenhauer, Hans-Joachim
Brülisauer, Tatjana
Komm, Dennis
Palano, Beatrice
Show all
Date
2016
Type
  • Conference Paper
Rights / license
In Copyright - Non-Commercial Use Permitted
Permanent link
https://doi.org/10.3929/ethz-a-010887432
Publication status
published
External links
Search via SFX
Editor
Freivalds, Rūsiņš M.
Engels, Gregor
Catania, Barbara
Book title
Theory and practice of computer science : SOFSEM 2016 : 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016 : proceedings
Journal / series
Lecture Notes in Computer Science
Volume
9587
Pages / Article No.
195 - 207
Publisher
Springer
Event
42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), Harrachov, Czech Republic, January 23-28, 2016
Subject
EXTREMAL PROBLEMS (GRAPH THEORY); GRAPHENALGORITHMEN + GEOMETRISCHE ALGORITHMEN (GRAPHENTHEORIE); TREES (GRAPH THEORY); ALGORITHMISCHE KOMPLEXITÄT (MATHEMATIK); EXTREMALPROBLEME (GRAPHENTHEORIE); ALGORITHMIC COMPLEXITY (MATHEMATICS); GRAPH ALGORITHMS + GEOMETRIC ALGORITHMS (GRAPH THEORY); BÄUME (GRAPHENTHEORIE)
Organisational unit
03666 - Hromkovic, Juraj  
02150 - Departement Informatik / Department of Computer Science
More
Show all metadata
Citations
Cited 2 times in Scopus
ETH Bibliography
yes
Altmetrics