You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Leicester » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Leicester

Return to search Previous output Next output

Output 10 of 71 in the submission

Article title

Approximation schemes for packing splittable items with cardinality constraints

Type

D - Journal article

DOI

10.1007/s00453-010-9445-6

Title of journal

Algorithmica (New York)

Article number

Volume number

Issue number

1-2

First page of article

102

ISSN of journal

0178-4617

Year of publication

2012

URL

Number of additional authors

Additional information

<12>The memory allocation problem considered here was studied in several earlier papers, and we provide best possible approximation algorithms for essentially all versions of it. Later papers, in particular by Beaumont et al. at INRIA (PDP 2010, IEEE Trans. Par. Distr. Syst. 2013, AlgoTel 2009, IPDPS 2013), considered closely related problems and generalizations.

Interdisciplinary

Cross-referral requested

Research group

None

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract