English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  On the Approximability of the Maximum Interval Constrained Coloring Problem

Canzar, S., Elbassioni, K., Elmasry, A., & Raman, R. (2010). On the Approximability of the Maximum Interval Constrained Coloring Problem. In O. Cheong, K.-Y. Chwa, & K. Park (Eds.), Algorithms and Computation (pp. 168-179). Berlin: Springer. doi:10.1007/978-3-642-17514-5_15.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Canzar, Stefan1, Author           
Elbassioni, Khaled1, Author           
Elmasry, Amr1, Author           
Raman, Rajiv1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20102010
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 536788
DOI: 10.1007/978-3-642-17514-5_15
URI: http://dx.doi.org/10.1007/978-3-642-17514-5_15
Other: Local-ID: C1256428004B93B8-5F33EABB31899F8DC125781900549418-Elbassioni2010
 Degree: -

Event

show
hide
Title: 21st International Symposium on Algorithms and Computation
Place of Event: Jeju Island, Korea
Start-/End Date: 2010-12-15 - 2010-12-17

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithms and Computation
  Subtitle : 21st International Symposium, ISAAC 2010. Pt. II
  Abbreviation : ISAAC 2010
Source Genre: Proceedings
 Creator(s):
Cheong, Otfried1, Editor
Chwa, Kyung-Yong1, Editor
Park, Kunsoo1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 168 - 179 Identifier: ISBN: 978-3-642-17513-8

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 6507 Sequence Number: - Start / End Page: - Identifier: -