The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
- 7 October 2011
- journal article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 25 (1) , 19-46
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Specializations and Generalizations of the Stackelberg Minimum Spanning Tree GameLecture Notes in Computer Science, 2010
- Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing2010
- On Stackelberg Pricing with Computationally Bounded ConsumersLecture Notes in Computer Science, 2009
- Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game2008
- Combinatorial Optimization on Graphs of Bounded TreewidthThe Computer Journal, 2007
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation NetworkTransportation Science, 2001
- A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting ProblemTransportation Science, 2000
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Finite automata, bounded treewidth and well-quasiordering1993