External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The complexity of an inverse shortest paths problem

Sándor P. Fekete, Winfried Hochstättler, Stephan Kromberg, Christoph Moll. The complexity of an inverse shortest paths problem. In Ronald L. Graham, Jan Kratochvíl, Jaroslav Nesetril, Fred S. Roberts, editors, Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, Proceedings of a DIMACS Workshop, Stirín Castle, Czech Republic, May 19-25, 1997. Volume 49 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 113-128, DIMACS/AMS, 1997.

Authors

Sándor P. Fekete

This author has not been identified. Look up 'Sándor P. Fekete' in Google

Winfried Hochstättler

This author has not been identified. Look up 'Winfried Hochstättler' in Google

Stephan Kromberg

This author has not been identified. Look up 'Stephan Kromberg' in Google

Christoph Moll

This author has not been identified. Look up 'Christoph Moll' in Google
runs on