Improved Approximation Algorithms for the Min-Max Selecting Items Problem

Doerr, Benjamin

doi:10.1016/j.ipl.2013.07.011

Local TagsRelease HistoryDetailsSummary

Improved Approximation Algorithms for the Min-Max Selecting Items Problem

Doerr, B. (2013). Improved Approximation Algorithms for the Min-Max Selecting Items Problem. Information Processing Letters, 113(19-21), 747-749. doi:10.1016/j.ipl.2013.07.011.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0015-3C4B-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0019-7D67-C

Genre: Journal Article

Latex : Improved Approximation Algorithms for the {Min-Max} Selecting Items Problem

Files

show Files

Locators

show

Creators

show

hide

Creators:
Doerr, Benjamin¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2013-09Date issued: 2013

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: Other: Local-ID: 4C7BC0DB27536794C1257C5300776916-Doerr2013AppAlg
BibTex Citekey: Doerr2013AppAlg
DOI: 10.1016/j.ipl.2013.07.011

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Information Processing Letters

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Elsevier

Pages: - Volume / Issue: 113 (19-21) Sequence Number: - Start / End Page: 747 - 749 Identifier: ISSN: 0020-0190
CoNE: https://pure.mpg.de/cone/journals/resource/954921346222