On the complexity of shortest path problems on discounted cost graphs

DOI10.1007/978-3-642-37064-9_6MaRDI QIDQ4910440zbMATH OpenOpenAlexFDO

Authors Sampath Kannan, Kevin T. Tian, Yifei Yuan, Rajeev Alur

Publication date 18 March 2013

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37064-9_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
• Regular functions and cost register automata (invited paper)
• Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
• Discount-optimal infinite runs in priced timed automata
• scientific article; zbMATH DE number 1794360

Cited in

(3)

• Theory and application of reciprocal transformation of “path problem” and “time float problem”
• Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
• scientific article; zbMATH DE number 7559473 (Why is no real title available?)

This page was built for publication: On the complexity of shortest path problems on discounted cost graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910440)