Minimum stable cut and treewidth
From MaRDI portal
Cites work
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- An improved algorithm for parameterized edge dominating set problem
- Approximating the best Nash equilibrium in \(n^{o(\log n)}\)-time breaks the exponential time hypothesis
- Convergence and approximation in potential games
- Grundy distinguishes treewidth from pathwidth
- How easy is local search?
- How Hard Is It to Approximate the Best Nash Equilibrium?
- scientific article; zbMATH DE number 176747 (Why is no real title available?)
- scientific article; zbMATH DE number 7650943 (Why is no real title available?)
- scientific article; zbMATH DE number 7650221 (Why is no real title available?)
- Improved equilibria via public service advertising
- Improving the smoothed complexity of FLIP for max cut problems
- Inapproximability of NP-complete variants of Nash equilibrium
- Inapproximability results for constrained approximate Nash equilibria
- Integer Linear Programs and Local Search for Max-Cut
- Local max-cut in smoothed polynomial time
- Maximum minimal vertex cover parameterized by vertex cover
- Nash and correlated equilibria: Some complexity considerations
- New complexity results about Nash equilibria
- Node-max-cut and the complexity of equilibrium in linear weighted congestion games
- On the complexity of constrained Nash equilibria in graphical games
- On the maximum weight minimal separator
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Parameterized (approximate) defective coloring
- Parameterized algorithms
- Parameterized Approximation Schemes Using Graph Widths
- Parameterized power vertex cover
- Settling the complexity of local max-cut (almost) completely
- Simple Local Search Problems that are Hard to Solve
- Small Clique Detection and Approximate Nash Equilibria
- Smoothed analysis of local search for the maximum-cut problem
- Smoothed complexity of local max-cut and binary max-CSP
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- Structurally parameterized \(d\)-scattered set
- The complexity of pure Nash equilibria
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design
- The lazy bureaucrat scheduling problem
- The many facets of upper domination
- The structure and complexity of Nash equilibria for a selfish routing game
- Time-approximation trade-offs for inapproximable problems
- Treewidth with a quantifier alternation revisited
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
- Weighted upper edge cover: complexity and approximability
- Which problems have strongly exponential complexity?
Cited in
(2)
This page was built for publication: Minimum stable cut and treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241192)
