Near-Perfect Load Balancing by Randomized Rounding

Friedrich, Tobias; Sauerwald, Thomas

Local TagsRelease HistoryDetailsSummary

Near-Perfect Load Balancing by Randomized Rounding

Friedrich, T., & Sauerwald, T. (2009). Near-Perfect Load Balancing by Randomized Rounding. In Proceedings of the 41st ACM Symposium on Theory of Computing (pp. 121-130). New York, NY: ACM.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1886-E Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-32B3-9

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Friedrich, Tobias¹, Author
Sauerwald, Thomas¹, Author

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

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-01-10Date issued: 2009

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 518335
Other: Local-ID: C1256428004B93B8-C32B22BEB698CD34C1257559004ADC71-FS09

Degree: -

Event

show

hide

Title: 41st ACM Symposium on Theory of Computing

Place of Event: Bethesda, Maryland, USA

Start-/End Date: 2009-05-31 - 2009-06-02

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the 41st ACM Symposium on Theory of Computing

Abbreviation : STOC 2009

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: New York, NY : ACM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 121 - 130 Identifier: -