English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Faster Approximation Schemes for the Two-dimensional Knapsack Problem

Heydrich, S., & Wiese, A. (2017). Faster Approximation Schemes for the Two-dimensional Knapsack Problem. In P. N. Klein (Ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 79-98). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974782.6.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-54AD-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-54AE-1
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Heydrich, Sandy1, Author           
Wiese, Andreas2, 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: 20172017
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1137/1.9781611974782.6
BibTex Citekey: HeydrichW17
 Degree: -

Event

show
hide
Title: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Barcelona, Spain
Start-/End Date: 2017-01-16 - 2017-01-19

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2017
Source Genre: Proceedings
 Creator(s):
Klein, Philip N.1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 79 - 98 Identifier: ISBN: 978-1-61197-478-2