Improved Purely Additive Fault-Tolerant Spanners
Let G be an unweighted n-node undirected graph. A β-additive spanner of G is a spanning subgraph H of G such that distances in H are stretched at most by an additive term β w.r.t. the corresponding distances in G. A natural research goal related with spanners is that of designing sparse spanners wit...
Saved in:
| Published in | Algorithms - ESA 2015 Vol. 9294; pp. 167 - 178 |
|---|---|
| Main Authors | , , , , |
| Format | Book Chapter |
| Language | English |
| Published |
Germany
Springer Berlin / Heidelberg
2015
Springer Berlin Heidelberg |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 3662483491 9783662483497 |
| ISSN | 0302-9743 1611-3349 |
| DOI | 10.1007/978-3-662-48350-3_15 |
Cover
| Abstract | Let G be an unweighted n-node undirected graph. A β-additive spanner of G is a spanning subgraph H of G such that distances in H are stretched at most by an additive term β w.r.t. the corresponding distances in G. A natural research goal related with spanners is that of designing sparse spanners with low stretch.
In this paper, we focus on fault-tolerant additive spanners, namely additive spanners which are able to preserve their additive stretch even when one edge fails. We are able to improve all known such spanners, in terms of either sparsity or stretch. In particular, we consider the sparsest known spanners with stretch 6, 28, and 38, and reduce the stretch to 4, 10, and 14, respectively (while keeping the same sparsity).
Our results are based on two different constructions. On one hand, we show how to augment (by adding a small number of edges) a fault-tolerant additive sourcewise spanner (that approximately preserves distances only from a given set of source nodes) into one such spanner that preserves all pairwise distances. On the other hand, we show how to augment some known fault-tolerant additive spanners, based on clustering techniques. This way we decrease the additive stretch without any asymptotic increase in their size. We also obtain improved fault-tolerant additive spanners for the case of one vertex failure, and for the case of f edge failures. |
|---|---|
| AbstractList | Let G be an unweighted n-node undirected graph. A β-additive spanner of G is a spanning subgraph H of G such that distances in H are stretched at most by an additive term β w.r.t. the corresponding distances in G. A natural research goal related with spanners is that of designing sparse spanners with low stretch.
In this paper, we focus on fault-tolerant additive spanners, namely additive spanners which are able to preserve their additive stretch even when one edge fails. We are able to improve all known such spanners, in terms of either sparsity or stretch. In particular, we consider the sparsest known spanners with stretch 6, 28, and 38, and reduce the stretch to 4, 10, and 14, respectively (while keeping the same sparsity).
Our results are based on two different constructions. On one hand, we show how to augment (by adding a small number of edges) a fault-tolerant additive sourcewise spanner (that approximately preserves distances only from a given set of source nodes) into one such spanner that preserves all pairwise distances. On the other hand, we show how to augment some known fault-tolerant additive spanners, based on clustering techniques. This way we decrease the additive stretch without any asymptotic increase in their size. We also obtain improved fault-tolerant additive spanners for the case of one vertex failure, and for the case of f edge failures. |
| Author | Gualà, Luciano Bilò, Davide Leucci, Stefano Grandoni, Fabrizio Proietti, Guido |
| Author_xml | – sequence: 1 givenname: Davide surname: Bilò fullname: Bilò, Davide email: davide.bilo@uniss.it organization: Dipartimento di Scienze Umanistiche e Sociali, Università di Sassari, Sassari, Italy – sequence: 2 givenname: Fabrizio surname: Grandoni fullname: Grandoni, Fabrizio email: fabrizio@idsia.ch organization: IDSIA, University of Lugano, Lugano, Switzerland – sequence: 3 givenname: Luciano surname: Gualà fullname: Gualà, Luciano email: guala@mat.uniroma2.it organization: Dipartimento di Ingegneria dell’Impresa, Università di Roma “Tor Vergata”, Rome, Italy – sequence: 4 givenname: Stefano surname: Leucci fullname: Leucci, Stefano email: stefano.leucci@univaq.it organization: DISIM, Università degli Studi dell’Aquila, L’Aquila, Italy – sequence: 5 givenname: Guido surname: Proietti fullname: Proietti, Guido email: guido.proietti@univaq.it organization: Istituto di Analisi dei Sistemi ed Informatica, CNR, Roma, Italy |
| BookMark | eNqNkMtOwzAQRQ0URFv6ByzyA4axx89lhShUqgQSZW05jguFkIQkrcTf4z7EmtVId-aMdM-IDKq6ioRcM7hhAPrWakORKsWpMCiBomPyhExSjCncZ3hKhkwxRhGFPSOj40JYNiBDQODUaoEXZGg5GGsN4CWZdN0HADBp0iUbEph_NW29jUX2vGlj-ZNNi2Ldr7cxm_lN2dNlXcbWV3320viqim13Rc5Xvuzi5DjH5HV2v7x7pIunh_nddEEbbkxPfa5XKnhudNAeojegNGdRFKwQudBYSC8C8FVAzwPPdSEF5IqjRQhKCcAx4Ye_XdOuq7fYuryuPzvHwO38uCTCoUuN3d6F2_lJkDhAqdP3Jna9izsqxKpvfRnefdOnCk4hMC6NY5ieWfgvJqWRyoo_7BfiUXaA |
| ContentType | Book Chapter |
| Copyright | Springer-Verlag Berlin Heidelberg 2015 |
| Copyright_xml | – notice: Springer-Verlag Berlin Heidelberg 2015 |
| DBID | FFUUA |
| DEWEY | 005.1 |
| DOI | 10.1007/978-3-662-48350-3_15 |
| DatabaseName | ProQuest Ebook Central - Book Chapters - Demo use only |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9783662483503 3662483505 |
| EISSN | 1611-3349 |
| Editor | Bansal, Nikhil Finocchi, Irene |
| Editor_xml | – sequence: 1 fullname: Bansal, Nikhil – sequence: 2 fullname: Finocchi, Irene |
| EndPage | 178 |
| ExternalDocumentID | EBC6301258_130_190 EBC5585694_130_190 |
| GroupedDBID | 0D6 0DA 38. AABBV AAGZE AAZAK AAZUS ABBVZ ABFTD ABMNI ACKNT ACRRC AEDXK AEJLV AEKFX AETDV AEZAY ALMA_UNASSIGNED_HOLDINGS APFYR AZZ BBABE CZZ FFUUA I4C IEZ IY- LDH SBO SFQCF TMQGW TPJZQ TSXQS TWXRB Z83 Z88 -DT -~X 29L 2HA 2HV ACGFS ADCXD EJD F5P LAS P2P RSU ~02 |
| ID | FETCH-LOGICAL-p288t-ab7f6ca287c7a0ea806721e4d1d4b473d5a4c02fc3a2c2b7d540b623930c66403 |
| ISBN | 3662483491 9783662483497 |
| ISSN | 0302-9743 |
| IngestDate | Tue Jul 29 19:45:30 EDT 2025 Thu May 29 16:13:39 EDT 2025 Thu May 29 16:17:32 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| LCCallNum | QA76.9.L63QA76.5913Q |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-p288t-ab7f6ca287c7a0ea806721e4d1d4b473d5a4c02fc3a2c2b7d540b623930c66403 |
| OCLC | 920899803 1227390011 |
| PQID | EBC5585694_130_190 |
| PageCount | 12 |
| ParticipantIDs | springer_books_10_1007_978_3_662_48350_3_15 proquest_ebookcentralchapters_6301258_130_190 proquest_ebookcentralchapters_5585694_130_190 |
| PublicationCentury | 2000 |
| PublicationDate | 2015 20151112 |
| PublicationDateYYYYMMDD | 2015-01-01 2015-11-12 |
| PublicationDate_xml | – year: 2015 text: 2015 |
| PublicationDecade | 2010 |
| PublicationPlace | Germany |
| PublicationPlace_xml | – name: Germany – name: Berlin, Heidelberg |
| PublicationSeriesSubtitle | Theoretical Computer Science and General Issues |
| PublicationSeriesTitle | Lecture Notes in Computer Science |
| PublicationSeriesTitleAlternate | Lect.Notes Computer |
| PublicationSubtitle | 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings |
| PublicationTitle | Algorithms - ESA 2015 |
| PublicationYear | 2015 |
| Publisher | Springer Berlin / Heidelberg Springer Berlin Heidelberg |
| Publisher_xml | – name: Springer Berlin / Heidelberg – name: Springer Berlin Heidelberg |
| RelatedPersons | Kleinberg, Jon M. Mattern, Friedemann Naor, Moni Mitchell, John C. Terzopoulos, Demetri Steffen, Bernhard Pandu Rangan, C. Kanade, Takeo Kittler, Josef Weikum, Gerhard Hutchison, David Tygar, Doug |
| RelatedPersons_xml | – sequence: 1 givenname: David surname: Hutchison fullname: Hutchison, David organization: Lancaster University, Lancaster, United Kingdom – sequence: 2 givenname: Takeo surname: Kanade fullname: Kanade, Takeo organization: Carnegie Mellon University, Pittsburgh, USA – sequence: 3 givenname: Josef surname: Kittler fullname: Kittler, Josef organization: University of Surrey, Guildford, United Kingdom – sequence: 4 givenname: Jon M. surname: Kleinberg fullname: Kleinberg, Jon M. organization: Cornell University, Ithaca, USA – sequence: 5 givenname: Friedemann surname: Mattern fullname: Mattern, Friedemann organization: CNB H 104.2, ETH Zurich, Zürich, Switzerland – sequence: 6 givenname: John C. surname: Mitchell fullname: Mitchell, John C. organization: Stanford, USA – sequence: 7 givenname: Moni surname: Naor fullname: Naor, Moni organization: Weizmann Institute of Science, Rehovot, Israel – sequence: 8 givenname: C. surname: Pandu Rangan fullname: Pandu Rangan, C. organization: Madras, Indian Institute of Technology, Chennai, India – sequence: 9 givenname: Bernhard surname: Steffen fullname: Steffen, Bernhard organization: Fakultät Informatik, TU Dortmund, Dortmund, Germany – sequence: 10 givenname: Demetri surname: Terzopoulos fullname: Terzopoulos, Demetri organization: University of California, Los Angeles, USA – sequence: 11 givenname: Doug surname: Tygar fullname: Tygar, Doug organization: University of California, Berkeley, USA – sequence: 12 givenname: Gerhard surname: Weikum fullname: Weikum, Gerhard organization: Max Planck Institute for Informatics, Saarbrücken, Germany |
| SSID | ssj0001584831 ssj0002792 |
| Score | 2.0299559 |
| Snippet | Let G be an unweighted n-node undirected graph. A β-additive spanner of G is a spanning subgraph H of G such that distances in H are stretched at most by an... |
| SourceID | springer proquest |
| SourceType | Publisher |
| StartPage | 167 |
| SubjectTerms | Additive Distortion Computer programming / software development Discrete mathematics Edge Failure Programming & scripting languages: general Short Path Span Subgraph White Vertex |
| Title | Improved Purely Additive Fault-Tolerant Spanners |
| URI | http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=5585694&ppg=190 http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=6301258&ppg=190 http://link.springer.com/10.1007/978-3-662-48350-3_15 |
| Volume | 9294 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF60XsSDb3yTg7ewkse-cqxSEVERrOJtSXZTPdRWbTzor3cmyZo2FEQvoYQlzPZbZuf5DSHHiY0VtyqgkVSCMqNiihQgVLDE8FAGiSwbaa9vxMU9u3zkj81M0LK7pMhOzNfcvpL_oArvAFfskv0Dsj8fhRfwG_CFJyAMz5bxOxtmrcqLh09j8OyfXyY-9Xt3XR8uWT59Aqp4ARiUt0ia_Ol3ra0Khc7Tj2FB--NhDhdV4d-BQhjVhfAuABDyVgDABQD9mh8L2c7ncWSV_RoiwuBhVRHr9B8YSGyuMp2unxDYXAXWGihtXW9mhrs6rIZ-trire6dnHPwRkTBMm2lc9PpGceQXpsbr-SeLZBFE65Clbu_y6qEJkIFppOIQ-3Gc2GHFmNRsY6oXcp6YM15DK9Fd2g_9NbKCPSUeNnuA4OtkIR9tkFU3UcOrFewmCRxmXoWZ5zDzZjHzHGZb5P681z-7oPVMC_oaKVXQNJMDYVLwU41MgzxVmAoPc2ZDyzImY8tTZoJoYOI0MlEmLVjUmUCeusAIwYJ4m3RG41G-Qzy05Y3k4G8bAWawhU_zJA3lIMm4HQRsl1C3e11m3utyX1PtdaJb0Py6XsBlEHHVrPfdX6px-UQ7CmzAQscasNAlFhqx2PujNPtkuTnsB6RTvH_kh2D_FdlRfVK-Ac3TUkw |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Algorithms+-+ESA+2015&rft.atitle=Improved+Purely+Additive+Fault-Tolerant+Spanners&rft.date=2015-01-01&rft.pub=Springer+Berlin+%2F+Heidelberg&rft.isbn=9783662483497&rft.volume=9294&rft_id=info:doi/10.1007%2F978-3-662-48350-3_15&rft.externalDBID=190&rft.externalDocID=EBC5585694_130_190 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F5585694-l.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F6301258-l.jpg |