Stackelberg Bipartite Vertex Cover and the Preflow Algorithm
- 28 March 2015
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 74 (3) , 1174-1183
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Stackelberg Network Pricing GamesAlgorithmica, 2010
- Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing2010
- PRICING GEOMETRIC TRANSPORTATION NETWORKSInternational Journal of Computational Geometry & Applications, 2009
- The Stackelberg Minimum Spanning Tree GameAlgorithmica, 2009
- An overview of Stackelberg pricing in networksEuropean Journal of Operational Research, 2008
- An approximation algorithm for Stackelberg network pricingNetworks, 2005
- A Bilevel Model of Taxation and Its Application to Optimal Highway PricingManagement Science, 1998
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972