English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  A Deterministic Truthful PTAS for Scheduling Related Machines

Christodoulou, G., & Kovács, A. (2010). A Deterministic Truthful PTAS for Scheduling Related Machines. In M. Charikar (Ed.), 21st Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1005-1016). Philadelphia, PA: SIAM.

Item is

Basic

show hide
Genre: Conference Paper
Latex : A Deterministic Truthful {PTAS} for Scheduling Related Machines

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Christodoulou, George1, Author           
Kovács, Annamária2, 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: 2010
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 536770
URI: http://portal.acm.org/citation.cfm?id=1873601.1873682
Other: Local-ID: C1256428004B93B8-B9B46BAAB3CA9D47C1257818002D3B8B-ChristodoulouKavacs2010
 Degree: -

Event

show
hide
Title: 21st Annual ACM-SIAM Symposium on Discrete Algorithm
Place of Event: Austin, Tx., USA
Start-/End Date: 2010-01-17 - 2010-01-19

Legal Case

show

Project information

show

Source 1

show
hide
Title: 21st Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2010
Source Genre: Proceedings
 Creator(s):
Charikar, Moses1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1005 - 1016 Identifier: ISBN: 978-0-898716-98-6