English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Coloring Problem

Canzar, S., Elbassioni, K., & Mestre, J. (2010). A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Coloring Problem. In Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10) (pp. 23-33). Philadelphia, PA: SIAM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-15FF-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-25DC-F
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Canzar, Stefan1, Author           
Elbassioni, Khaled1, 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: 2010
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 536717
URI: http://www.siam.org/proceedings/alenex/2010/alx10_003_canzars.pdf
Other: Local-ID: C1256428004B93B8-947E450D8ADD2C6FC1257682002F89AB-Mestre2010a
 Degree: -

Event

show
hide
Title: 2010 Workshop on Algorithm Engineering and Experiments
Place of Event: Austin, Texas
Start-/End Date: 2009-01-16 - 2009-01-16

Legal Case

show

Project information

show

Source 1

show
hide
Title: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10)
  Abbreviation : ALENEX 2010
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 23 - 33 Identifier: ISBN: 978-1-615-67817-4