Network-based dissolution

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

doi:10.1007/978-3-662-44465-8_7

Network-based dissolution

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings
Publisher	Springer Verlag
Pages	69-80
Number of pages	12
Edition	PART 2
ISBN (Print)	9783662444641
DOIs	https://doi.org/10.1007/978-3-662-44465-8_7
State	Published - 1 Jan 2014
Externally published	Yes
Event	39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014 - Budapest, Hungary Duration: 25 Aug 2014 → 29 Aug 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	8635 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014
Country/Territory	Hungary
City	Budapest
Period	25/08/14 → 29/08/14

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-44465-8_7

Cite this

Van Bevern, R., Bredereck, R., Chen, J., Froese, V., Niedermeier, R., & Woeginger, G. J. (2014). Network-based dissolution. In Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings (PART 2 ed., pp. 69-80). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8635 LNCS, No. PART 2). Springer Verlag. https://doi.org/10.1007/978-3-662-44465-8_7

Van Bevern, René ; Bredereck, Robert ; Chen, Jiehua et al. / Network-based dissolution. Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2. ed. Springer Verlag, 2014. pp. 69-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).

@inproceedings{4215b91703fc4228843dec02c9a7af2e,

title = "Network-based dissolution",

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.",

author = "\{Van Bevern\}, Ren{\'e} and Robert Bredereck and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Woeginger, \{Gerhard J.\}",

year = "2014",

month = jan,

day = "1",

doi = "10.1007/978-3-662-44465-8\_7",

language = "English",

isbn = "9783662444641",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

number = "PART 2",

pages = "69--80",

booktitle = "Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings",

address = "Germany",

edition = "PART 2",

note = "39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014 ; Conference date: 25-08-2014 Through 29-08-2014",

}

Van Bevern, R, Bredereck, R, Chen, J, Froese, V, Niedermeier, R & Woeginger, GJ 2014, Network-based dissolution. in Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 8635 LNCS, Springer Verlag, pp. 69-80, 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, Budapest, Hungary, 25/08/14. https://doi.org/10.1007/978-3-662-44465-8_7

Network-based dissolution. / Van Bevern, René; Bredereck, Robert; Chen, Jiehua et al.
Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2. ed. Springer Verlag, 2014. p. 69-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8635 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Network-based dissolution

AU - Van Bevern, René

AU - Bredereck, Robert

AU - Chen, Jiehua

AU - Froese, Vincent

AU - Niedermeier, Rolf

AU - Woeginger, Gerhard J.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84906240526

U2 - 10.1007/978-3-662-44465-8_7

DO - 10.1007/978-3-662-44465-8_7

M3 - Conference contribution

AN - SCOPUS:84906240526

SN - 9783662444641

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 69

EP - 80

BT - Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings

PB - Springer Verlag

T2 - 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014

Y2 - 25 August 2014 through 29 August 2014

ER -

Van Bevern R, Bredereck R, Chen J, Froese V, Niedermeier R, Woeginger GJ. Network-based dissolution. In Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2 ed. Springer Verlag. 2014. p. 69-80. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). doi: 10.1007/978-3-662-44465-8_7

Network-based dissolution

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this