The complexity of optimizing atomic congestion

Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27) Potential and congestion games (91A14)

Cites Work

Unnamed Item
Unnamed Item
Fundamentals of parameterized complexity
Sparsity. Graphs, structures, and algorithms
The dag-width of directed graphs
Digraph measures: Kelly decompositions, games, and orderings
Graph searching and a min-max theorem for tree-width
The complexity landscape of decompositional parameters for ILP
New algorithms for maximum disjoint paths based on tree-likeness
Directed tree-width
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability
XSAT and NAE-SAT of linear CNF classes
A class of games possessing pure-strategy Nash equilibria
The power of cut-based parameters for computing edge-disjoint paths
The complexity of binary matrix completion under diameter constraints
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees
The complexity of pure Nash equilibria
The price of anarchy of finite congestion games
Graph minors. II. Algorithmic aspects of tree-width
Parameterized Complexity Results for Exact Bayesian Network Structure Learning
Immersions in Highly Edge Connected Graphs
Algorithmic Applications of Tree-Cut Width
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
Data Reduction for Maximum Matching on Real-World Graphs
Parameterized Algorithms
Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming
The Price of Routing Unsplittable Flow
Delay-robust routes in temporal graphs
Slim tree-cut width

This page was built for publication: The complexity of optimizing atomic congestion