Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs - Research Collection

Metadata only

Author

Mihalák, Matúš

Šrámek, Rastislav

Widmayer, Peter

Date

2016-01

Type

Journal Article

Citations

Cited 5 times in Web of Science

Cited 10 times in Scopus

ETH Bibliography

yes

Altmetrics

Publication status

published

External links

https://doi.org/10.1007/s00224-014-9571-7

Journal / series

Theory of Computing Systems

Volume

58(1)

Pages / Article No.

45 - 59

Publisher

Springer

Subject

Approximation algorithms; Counting; Shortest paths

Organisational unit

03340 - Widmayer, Peter / Widmayer, Peter

More

Show all metadata

Citations

Cited 5 times in Web of Science

Cited 10 times in Scopus

ETH Bibliography

yes

Altmetrics