Oct 7, 2011 · The Stackelberg Minimum Spanning Tree Game is a two-level combinatorial pricing problem played on a graph representing a network.

Sep 17, 2009 · The Stackelberg Minimum Spanning Tree Game is a two-level combinatorial pricing problem played on a graph representing a network.

The goal of the first player is to maximize the total price of purchased blue edges. We study this problem in the cases of planar and bounded-treewidth graphs.

The goal of the first player is to maximize the total price of purchased blue edges. We study this problem in the cases of planar and bounded-treewidth graphs.

Abstract The Stackelberg Minimum Spanning Tree Game is a two-level combinato- rial pricing problem played on a graph representing a network.

Sep 17, 2009 · In this paper, we consider the STACKMST problem in these two graph classes: planar graphs and bounded-treewidth graphs. We prove in Section 2 ...

Sep 17, 2009 · In this paper, we consider the STACKMST problem in these two graph classes: planar graphs and bounded-treewidth graphs. We prove in Section 2 ...

The goal of the first player is to maximize the total price of purchased blue edges. We study this problem in the cases of planar and bounded-treewidth graphs.

The Stackelberg Minimum Spanning Tree Game is a two-level combinatorial pricing problem played on a graph representing a network that is NP-hard on planar ...

The game is played on a graph (representing a network), whose edges are colored either red or blue, and where the red edges have a given fixed cost ( ...