Denser Packings Obtained in O(n log log n) time
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
Denser Packings Obtained in O(n log log n) time. / Pisinger, David.
In: INFORMS Journal on Computing, Vol. 19, No. 3, 2007, p. 395-405.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
Pisinger, D 2007, 'Denser Packings Obtained in O(n log log n) time', INFORMS Journal on Computing, vol. 19, no. 3, pp. 395-405. https://doi.org/10.1287/ijoc.1060.0192
APA
Pisinger, D. (2007). Denser Packings Obtained in O(n log log n) time. INFORMS Journal on Computing, 19(3), 395-405. https://doi.org/10.1287/ijoc.1060.0192
Vancouver
Pisinger D. Denser Packings Obtained in O(n log log n) time. INFORMS Journal on Computing. 2007;19(3):395-405. https://doi.org/10.1287/ijoc.1060.0192
Author
Bibtex
@article{807bda808fc611dd86a6000ea68e967b,
title = "Denser Packings Obtained in O(n log log n) time",
keywords = "Faculty of Science, kombinatorisk optimering, algoritmer, pakningsproblemer, combinatorial optimization, algorithms, packing problems",
author = "David Pisinger",
year = "2007",
doi = "10.1287/ijoc.1060.0192",
language = "English",
volume = "19",
pages = "395--405",
journal = "INFORMS Journal on Computing",
issn = "1091-9856",
publisher = "Institute for Operations Research and the Management Sciences (I N F O R M S)",
number = "3",
}
RIS
TY - JOUR
T1 - Denser Packings Obtained in O(n log log n) time
AU - Pisinger, David
PY - 2007
Y1 - 2007
KW - Faculty of Science
KW - kombinatorisk optimering
KW - algoritmer
KW - pakningsproblemer
KW - combinatorial optimization
KW - algorithms
KW - packing problems
U2 - 10.1287/ijoc.1060.0192
DO - 10.1287/ijoc.1060.0192
M3 - Journal article
VL - 19
SP - 395
EP - 405
JO - INFORMS Journal on Computing
JF - INFORMS Journal on Computing
SN - 1091-9856
IS - 3
ER -
ID: 6362415