Dividing Connected Chores Fairly

Heydrich, Sandy; van Stee, Rob

doi:10.1016/j.tcs.2015.05.041

Local TagsRelease HistoryDetailsSummary

Dividing Connected Chores Fairly

Heydrich, S., & van Stee, R. (2015). Dividing Connected Chores Fairly. Theoretical Computer Science, 593, 51-61. doi:10.1016/j.tcs.2015.05.041.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-501E-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-501F-B

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Heydrich, Sandy¹, Author
van Stee, Rob², Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2015Date issued: 2015

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1016/j.tcs.2015.05.041
BibTex Citekey: Heydrich2015

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Theoretical Computer Science

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 593 Sequence Number: - Start / End Page: 51 - 61 Identifier: ISSN: 0304-3975
CoNE: https://pure.mpg.de/cone/journals/resource/954925512450