The parameterized complexity of welfare guarantees in Schelling segregation
From MaRDI portal
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A DYNAMIC MODEL OF RESIDENTIAL SEGREGATION
- Bin packing with fixed number of bins revisited
- Convergence and hardness of strategic Schelling segregation
- Digital morphogenesis via schelling segregation
- Exponential segregation in a two-dimensional Schelling model with tolerant individuals
- Fundamentals of parameterized complexity
- How easy is local search?
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Minority population in the one-dimensional Schelling model of segregation
- Modified Schelling games
- Not all strangers are the same: the impact of tolerance in Schelling games
- On the complexity of the parity argument and other inefficient proofs of existence
- On total functions, existence theorems and computational complexity
- Parameterized algorithms
- Schelling games on graphs
- Schelling segregation with strategic agents
- Single-Peaked Jump Schelling Games
- The parameterized complexity of the k-biclique problem
- Tipping points in 1-dimensional Schelling models with switching agents
- Topological Influence and Locality in Swap Schelling Games.
- Treewidth. Computations and approximations
- Unperturbed Schelling segregation in two or three dimensions
- Welfare guarantees in Schelling segregation
This page was built for publication: The parameterized complexity of welfare guarantees in Schelling segregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614026)
