Shortest Paths with Bundles and Non-additive Weights Is Hard

DOI10.1007/978-3-642-38233-8_22zbMath1382.68091OpenAlexW73230629MaRDI QIDQ4924655

Antony McCabe, Paul W. Goldberg

Publication date: 7 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38233-8_22

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Sequence Hypergraphs ⋮ Sequence Hypergraphs: Paths, Flows, and Cuts

This page was built for publication: Shortest Paths with Bundles and Non-additive Weights Is Hard