Dividing Connected Chores Fairly

Local TagsRelease HistoryDetailsSummary

Dividing Connected Chores Fairly

Heydrich, S. (2012). Dividing Connected Chores Fairly. Bachelor Thesis, Universität des Saarlandes, Saarbrücken.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-BAB3-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-BAB5-B

Genre: Thesis

show

show

hide

Creators:
Heydrich, Sandy¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

show

show

hide

Language(s): eng - English

Dates: Date issued: 2012

Publication Status: Issued

Pages: -

Publishing info: Saarbrücken : Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: HeidrichBachelor2012
Other: Local-ID: 5580BFB38554D223C1257B160045F15A-HeidrichBachelor2012

Degree: Bachelor

show

show

show

show