@incollection{george_best_2013,
	series = {{SpringerBriefs} in {Computer} {Science}},
	title = {Best {Start} {Time} {Journeys}},
	copyright = {©2013 The Author(s)},
	isbn = {978-1-4614-4917-1 978-1-4614-4918-8},
	url = {http://link.springer.com/chapter/10.1007/978-1-4614-4918-8_4},
	abstract = {The time dependence of parameters in a spatio-temporal network adds to the semantics of common network operations. The result of any analysis in a time dependent network depends on the time at which it is performed. Shortest path from an origin to a destination can vary significantly depending on the start time. This leads to an important and interesting formulation of shortest path computation, “When is the best time to start a journey so that the time spent in the network is minimized?” This chapter describes this formulation in detail and presents algorithms for the computation of ‘best start time’ shortest paths.},
	language = {en},
	urldate = {2016-12-16},
	booktitle = {Spatio-temporal {Networks} {Modeling} and {Algorithms}},
	publisher = {Springer New York},
	author = {George, Betsy and Kim, Sangho},
	year = {2013},
	doi = {10.1007/978-1-4614-4918-8_4},
	note = {00000 },
	pages = {45--64},
}

{"_id":"jqicZAEmBFfdGNQLN","bibbaseid":"george-kim-beststarttimejourneys-2013","author_short":["George, B.","Kim, S."],"bibdata":{"bibtype":"incollection","type":"incollection","series":"SpringerBriefs in Computer Science","title":"Best Start Time Journeys","copyright":"©2013 The Author(s)","isbn":"978-1-4614-4917-1 978-1-4614-4918-8","url":"http://link.springer.com/chapter/10.1007/978-1-4614-4918-8_4","abstract":"The time dependence of parameters in a spatio-temporal network adds to the semantics of common network operations. The result of any analysis in a time dependent network depends on the time at which it is performed. Shortest path from an origin to a destination can vary significantly depending on the start time. This leads to an important and interesting formulation of shortest path computation, “When is the best time to start a journey so that the time spent in the network is minimized?” This chapter describes this formulation in detail and presents algorithms for the computation of ‘best start time’ shortest paths.","language":"en","urldate":"2016-12-16","booktitle":"Spatio-temporal Networks Modeling and Algorithms","publisher":"Springer New York","author":[{"propositions":[],"lastnames":["George"],"firstnames":["Betsy"],"suffixes":[]},{"propositions":[],"lastnames":["Kim"],"firstnames":["Sangho"],"suffixes":[]}],"year":"2013","doi":"10.1007/978-1-4614-4918-8_4","note":"00000 ","pages":"45–64","bibtex":"@incollection{george_best_2013,\n\tseries = {{SpringerBriefs} in {Computer} {Science}},\n\ttitle = {Best {Start} {Time} {Journeys}},\n\tcopyright = {©2013 The Author(s)},\n\tisbn = {978-1-4614-4917-1 978-1-4614-4918-8},\n\turl = {http://link.springer.com/chapter/10.1007/978-1-4614-4918-8_4},\n\tabstract = {The time dependence of parameters in a spatio-temporal network adds to the semantics of common network operations. The result of any analysis in a time dependent network depends on the time at which it is performed. Shortest path from an origin to a destination can vary significantly depending on the start time. This leads to an important and interesting formulation of shortest path computation, “When is the best time to start a journey so that the time spent in the network is minimized?” This chapter describes this formulation in detail and presents algorithms for the computation of ‘best start time’ shortest paths.},\n\tlanguage = {en},\n\turldate = {2016-12-16},\n\tbooktitle = {Spatio-temporal {Networks} {Modeling} and {Algorithms}},\n\tpublisher = {Springer New York},\n\tauthor = {George, Betsy and Kim, Sangho},\n\tyear = {2013},\n\tdoi = {10.1007/978-1-4614-4918-8_4},\n\tnote = {00000 },\n\tpages = {45--64},\n}\n\n","author_short":["George, B.","Kim, S."],"key":"george_best_2013-1","id":"george_best_2013-1","bibbaseid":"george-kim-beststarttimejourneys-2013","role":"author","urls":{"Paper":"http://link.springer.com/chapter/10.1007/978-1-4614-4918-8_4"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"incollection","biburl":"https://bibbase.org/zotero/wybert","dataSources":["TJkbwzD8s2wCxBy6Y"],"keywords":[],"search_terms":["best","start","time","journeys","george","kim"],"title":"Best Start Time Journeys","year":2013}