@InProceedings{chakraborty_et_al:LIPIcs.SWAT.2018.15,
  author =	{Chakraborty, Diptarka and Das, Debarati},
  title =	{{Sparse Weight Tolerant Subgraph for Single Source Shortest Path}},
  booktitle =	{16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)},
  pages =	{15:1--15:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-068-2},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{101},
  editor =	{Eppstein, David},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.15},
  URN =		{urn:nbn:de:0030-drops-88413},
  doi =		{10.4230/LIPIcs.SWAT.2018.15},
  annote =	{Keywords: Shortest path, fault tolerant, distance preserver, graph algorithm}
}