The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
Jean CardinalErik D. DemaineSamuel FioriniGwenaël JoretIlan NewmanOren WeimannPublished in: CoRR (2009)
Keyphrases
- minimum spanning tree
- bounded treewidth
- game theory
- np complete
- spanning tree
- nash equilibria
- nash equilibrium
- graph theory
- weighted graph
- shortest path
- conjunctive queries
- boolean functions
- decision problems
- minimum weight
- traveling salesman problem
- relational learning
- edge weights
- ant colony optimization
- query answering
- incomplete information
- semi supervised
- np hard