Network-Based Vertex Dissolution
DOI10.1137/140978880zbMath1327.68139arXiv1402.2664OpenAlexW2131577826MaRDI QIDQ5254088
Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, René van Bevern, Gerhard J. Woeginger
Publication date: 8 June 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.2664
matchingcombinatorial algorithmsNP-hard problemsflow networkselection controlpolitical districtingcomputational complexity analysiseconomizationredistribution scenarios
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Deterministic network models in operations research (90B10) History, political science (91F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Flows in graphs (05C21)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Combinatorial and computational aspects of graph packing and graph decomposition
- A fair division solution to the problem of redistricting
- Optimal redistricting under geographical constraints: why ``pack and crack does not work
- How hard is it to control an election?
- A computational approach to unbiased districting
- The path partition problem and related problems in bipartite graphs
- Parametrized complexity theory.
- An Optimization Based Heuristic for Political Districting
- Reflections on Multivariate Algorithmics and Problem Parameterization
- Generalized planar matching
- Easy problems for tree-decomposable graphs
- On Restricted Two-Factors
- A spanning tree heuristic for regional clustering
- Control and Bribery in Voting
- Star Partitions of Perfect Graphs
- Parameterized and Exact Computation
- Multiplying matrices faster than coppersmith-winograd
This page was built for publication: Network-Based Vertex Dissolution
