Abstract
The talk will provide an overview of problems and results concerning spanning trees with low maximum or average stretch and trees with low communication cost, in weighted or unweighted graphs and in metrics, and outline some techniques for dealing with these problems.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Editors | Rossella Petreschi, Riccardo Silvestri , Giuseppe Persiano |
| Publisher | Springer Verlag |
| Pages | 6 |
| Number of pages | 1 |
| ISBN (Print) | 3540401768, 9783540401766 |
| DOIs | |
| State | Published - 2003 |
| Externally published | Yes |
| Event | 5th Italian Conference on Algorithms and Complexity, CIAC 2003 - Rome, Italy Duration: 28 May 2003 → 30 May 2003 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 2653 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 5th Italian Conference on Algorithms and Complexity, CIAC 2003 |
|---|---|
| Country/Territory | Italy |
| City | Rome |
| Period | 28/05/03 → 30/05/03 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2003.