{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T18:45:46Z","timestamp":1747853146631},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,28]],"date-time":"2015-03-28T00:00:00Z","timestamp":1427500800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s00453-015-9993-x","type":"journal-article","created":{"date-parts":[[2015,3,28]],"date-time":"2015-03-28T22:14:37Z","timestamp":1427580877000},"page":"1174-1183","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Stackelberg Bipartite Vertex Cover and the Preflow Algorithm"],"prefix":"10.1007","volume":"74","author":[{"given":"Mourad","family":"Ba\u00efou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Barahona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,28]]},"reference":[{"key":"9993_CR1","doi-asserted-by":"crossref","unstructured":"Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., Nanongkai, D.: Improved hardness of approximation for Stackelberg shortest-path pricing. In: Internet and Network Economics, pp. 444\u2013454. Springer (2010)","DOI":"10.1007\/978-3-642-17572-5_37"},{"key":"9993_CR2","doi-asserted-by":"crossref","unstructured":"Briest, P., Hoefer, M., Guala, L., Ventre, C.: On Stackelberg pricing with computationally bounded consumers. In: Internet and Network Economics, pp. 42\u201354. Springer (2009)","DOI":"10.1007\/978-3-642-10841-9_6"},{"key":"9993_CR3","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1007\/s00453-010-9480-3","volume":"62","author":"P Briest","year":"2012","unstructured":"Briest, P., Hoefer, M., Krysta, P.: Stackelberg network pricing games. Algorithmica 62, 733\u2013753 (2012)","journal-title":"Algorithmica"},{"key":"9993_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s00453-009-9299-y","volume":"59","author":"J Cardinal","year":"2011","unstructured":"Cardinal, J., Demaine, E.D., Fiorini, S., Joret, G., Langerman, S., Newman, I., Weimann, O.: The Stackelberg minimum spanning tree game. Algorithmica 59, 129\u2013144 (2011)","journal-title":"Algorithmica"},{"key":"9993_CR5","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1142\/S021819590900309X","volume":"19","author":"J Cardinal","year":"2009","unstructured":"Cardinal, J., Labb\u00e9, M., Langerman, S., Palop, B.: Pricing geometric transportation networks. Int. J. Comput. Geom. Appl. 19, 507\u2013520 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9993_CR6","first-page":"754","volume":"194","author":"E Dinits","year":"1970","unstructured":"Dinits, E.: Algorithm of solution to problem of maximum flow in network with power estimates. Dokl. Akad. Nauk SSSR 194, 754 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"9993_CR7","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM (JACM) 19, 248\u2013264 (1972)","journal-title":"J. ACM (JACM)"},{"key":"9993_CR8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18, 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"9993_CR9","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM (JACM) 35, 921\u2013940 (1988)","journal-title":"J. ACM (JACM)"},{"key":"9993_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"DS Johnson","year":"1979","unstructured":"Johnson, D.S., Garey, M.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman&Co, San Francisco (1979)"},{"key":"9993_CR11","first-page":"117","volume":"57","author":"G Joret","year":"2011","unstructured":"Joret, G.: Stackelberg network pricing is hard to approximate. Networks 57, 117\u2013120 (2011)","journal-title":"Networks"},{"key":"9993_CR12","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1287\/mnsc.44.12.1608","volume":"44","author":"M Labb\u00e9","year":"1998","unstructured":"Labb\u00e9, M., Marcotte, P., Savard, G.: A bilevel model of taxation and its application to optimal highway pricing. Manag. Sci. 44, 1608\u20131622 (1998)","journal-title":"Manag. Sci."},{"key":"9993_CR13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/net.20074","volume":"46","author":"S Roch","year":"2005","unstructured":"Roch, S., Savard, G., Marcotte, P.: An approximation algorithm for Stackelberg network pricing. Networks 46, 57\u201367 (2005)","journal-title":"Networks"},{"key":"9993_CR14","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1016\/j.ejor.2006.08.064","volume":"189","author":"S Hoesel van","year":"2008","unstructured":"van Hoesel, S.: An overview of Stackelberg pricing in networks. Eur. J. Oper. Res. 189, 1393\u20131402 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9993_CR15","volume-title":"Marktform und gleichgewicht","author":"H Stackelberg Von","year":"1934","unstructured":"Von Stackelberg, H.: Marktform und gleichgewicht. Springer, Vienna (1934)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9993-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-9993-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9993-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:23Z","timestamp":1559072843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-9993-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,28]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["9993"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-9993-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,28]]}}}