The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs.
Jean CardinalErik D. DemaineSamuel FioriniGwenaël JoretIlan NewmanOren WeimannPublished in: J. Comb. Optim. (2013)
Keyphrases
- minimum spanning tree
- bounded treewidth
- game theory
- spanning tree
- np complete
- nash equilibrium
- nash equilibria
- graph theory
- conjunctive queries
- decision problems
- traveling salesman problem
- weighted graph
- shortest path
- boolean functions
- graph theoretic
- minimum weight
- ant colony optimization
- relational learning
- worst case
- incomplete information
- bipartite graph
- bounded degree