English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Approximation Algorithms for the Interval Constrained Coloring Problem

Althaus, E., Canzar, S., Elbassioni, K., Karrenbauer, A., & Mestre, J. (2011). Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica, 61(2), 342-361. doi:10.1007/s00453-010-9406-0.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-11EC-0 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-5F44-C
Genre: Journal Article

Files

show Files

Locators

show
hide
Locator:
https://rdcu.be/dx73o (Publisher version)
Description:
-
OA-Status:
Not specified

Creators

show
hide
 Creators:
Althaus, Ernst1, Author           
Canzar, Stefan1, Author           
Elbassioni, Khaled1, Author           
Karrenbauer, Andreas1, Author                 
Mestre, Julian1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20112011
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 618728
DOI: 10.1007/s00453-010-9406-0
URI: http://dx.doi.org/10.1007/s00453-010-9406-0
Other: Local-ID: C1256428004B93B8-8A8CF81C3F3099D9C1257984005B1F14-Elbassioni2011l
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithmica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: New York : Springer-Verlag
Pages: - Volume / Issue: 61 (2) Sequence Number: - Start / End Page: 342 - 361 Identifier: ISSN: 0178-4617
CoNE: https://pure.mpg.de/cone/journals/resource/954925487793