Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing

Briest, Patrick; Chalermsook, Parinya; Khanna, Sanjeev; Laekhanukit, Bundit; Nanongkai, Danupon

doi:10.1007/978-3-642-17572-5_37

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., & Nanongkai, D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In A. Saberi (Ed.), Internet and Network Economics (pp. 444-454). Berlin: Springer.

Cite as: https://hdl.handle.net/21.11116/0000-000E-14C0-2

Abstract

There is no abstract available