Maximum Volume Subset Selection for Anchored Boxes

Bringmann, Karl; Cabello, Sergio; Emmerich, Michael

doi:10.4230/LIPIcs.SoCG.2017.22

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2399565_3

DetailsSummary

Released

Conference Paper

Maximum Volume Subset Selection for Anchored Boxes

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2017/7201/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K., Cabello, S., & Emmerich, M. (2017). Maximum Volume Subset Selection for Anchored Boxes. In B. Aranov, & M. J. Katz (Eds.), 33rd International Symposium on Computational Geometry (pp. 1-15). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SoCG.2017.22.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-7D6F-9

Abstract

There is no abstract available