[{"date_created":"2020-09-04T12:01:18Z","author":[{"first_name":"Patrick","full_name":"Briest, Patrick","last_name":"Briest"},{"first_name":"Parinya","last_name":"Chalermsook","full_name":"Chalermsook, Parinya"},{"full_name":"Khanna, Sanjeev","last_name":"Khanna","first_name":"Sanjeev"},{"first_name":"Bundit","last_name":"Laekhanukit","full_name":"Laekhanukit, Bundit"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"date_updated":"2022-01-06T06:53:57Z","doi":"10.1007/978-3-642-17572-5_37","title":"Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing","publication_identifier":{"isbn":["9783642175718","9783642175725"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"ieee":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in <i>Workshop on Internet and Network Economics (WINE)</i>, 2010.","chicago":"Briest, Patrick, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, and Danupon Nanongkai. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” In <i>Workshop on Internet and Network Economics (WINE)</i>, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>.","ama":"Briest P, Chalermsook P, Khanna S, Laekhanukit B, Nanongkai D. Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In: <i>Workshop on Internet and Network Economics (WINE)</i>. ; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>","short":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in: Workshop on Internet and Network Economics (WINE), 2010.","mla":"Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” <i>Workshop on Internet and Network Economics (WINE)</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>.","bibtex":"@inproceedings{Briest_Chalermsook_Khanna_Laekhanukit_Nanongkai_2010, title={Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>}, booktitle={Workshop on Internet and Network Economics (WINE)}, author={Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}, year={2010} }","apa":"Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., &#38; Nanongkai, D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In <i>Workshop on Internet and Network Economics (WINE)</i>. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>"},"year":"2010","department":[{"_id":"63"}],"user_id":"15415","_id":"19029","language":[{"iso":"eng"}],"publication":"Workshop on Internet and Network Economics (WINE)","type":"conference","status":"public"}]