Network-based dissolution

René Van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

We introduce a graph-theoretic dissolution model that applies to a number of redistribution scenarios such as gerrymandering in political districting or work balancing in an online situation. The central aspect of our model is the deletion of certain vertices and the redistribution of their loads to neighboring vertices in a perfectly balanced way. We investigate how the underlying graph structure, the pre-knowledge of which vertices should be deleted, and the relation between old and new vertex loads influence the computational complexity of the underlying graph problems. Our results establish a clear borderline between tractable and intractable cases.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings
PublisherSpringer-Verlag GmbH and Co. KG
Pages69-80
Number of pages12
EditionPART 2
ISBN (Print)9783662444641
DOIs
Publication statusPublished - 1 Jan 2014
Externally publishedYes
Event39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014 - Budapest, Hungary
Duration: 25 Aug 201429 Aug 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume8635 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014
CountryHungary
CityBudapest
Period25.08.201429.08.2014

Fingerprint

Dive into the research topics of 'Network-based dissolution'. Together they form a unique fingerprint.

Cite this