Spanning trees with low maximum/average stretch

David Peleg

doi:10.1007/3-540-44849-7_6

Spanning trees with low maximum/average stretch

David Peleg

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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	https://doi.org/10.1007/3-540-44849-7_6
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.

Access to Document

10.1007/3-540-44849-7_6

Cite this

Peleg, D. (2003). Spanning trees with low maximum/average stretch. In R. Petreschi, R. Silvestri , & G. Persiano (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 6). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2653). Springer Verlag. https://doi.org/10.1007/3-540-44849-7_6

Peleg, David. / Spanning trees with low maximum/average stretch. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Rossella Petreschi ; Riccardo Silvestri ; Giuseppe Persiano. Springer Verlag, 2003. pp. 6 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e4cdbb2eb3c8465bacd2e074239e9a3c,

title = "Spanning trees with low maximum/average stretch",

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.",

author = "David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2003.; 5th Italian Conference on Algorithms and Complexity, CIAC 2003 ; Conference date: 28-05-2003 Through 30-05-2003",

year = "2003",

doi = "10.1007/3-540-44849-7\_6",

language = "אנגלית",

isbn = "3540401768",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "6",

editor = "Rossella Petreschi and \{Silvestri \}, Riccardo and Giuseppe Persiano",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "גרמניה",

}

Peleg, D 2003, Spanning trees with low maximum/average stretch. in R Petreschi, R Silvestri & G Persiano (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2653, Springer Verlag, pp. 6, 5th Italian Conference on Algorithms and Complexity, CIAC 2003, Rome, Italy, 28/05/03. https://doi.org/10.1007/3-540-44849-7_6

Spanning trees with low maximum/average stretch. / Peleg, David.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Rossella Petreschi; Riccardo Silvestri ; Giuseppe Persiano. Springer Verlag, 2003. p. 6 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2653).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Spanning trees with low maximum/average stretch

AU - Peleg, David

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2003.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84948143873

U2 - 10.1007/3-540-44849-7_6

DO - 10.1007/3-540-44849-7_6

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84948143873

SN - 3540401768

SN - 9783540401766

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 6

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Petreschi, Rossella

A2 - Silvestri , Riccardo

A2 - Persiano, Giuseppe

PB - Springer Verlag

T2 - 5th Italian Conference on Algorithms and Complexity, CIAC 2003

Y2 - 28 May 2003 through 30 May 2003

ER -

Peleg D. Spanning trees with low maximum/average stretch. In Petreschi R, Silvestri R, Persiano G, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 6. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44849-7_6

Spanning trees with low maximum/average stretch

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this