Packing to angles and sectors
- 9 June 2007
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 171-180
- https://doi.org/10.1145/1248377.1248405
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On Bin Packing with ConflictsPublished by Springer Nature ,2007
- Approximation Algorithms for Capacitated Rectangle StabbingPublished by Springer Nature ,2006
- Covering Problems with Hard CapacitiesSIAM Journal on Computing, 2006
- Capacity bounds for ad-hoc networks using directional antennasPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- On the maximum stable throughput problem in random networks with directional antennasPublished by Association for Computing Machinery (ACM) ,2003
- On the capacity improvement of ad hoc wireless networks using directional antennasPublished by Association for Computing Machinery (ACM) ,2003
- Capacitated vertex coveringJournal of Algorithms, 2003
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- An analysis of the greedy algorithm for the submodular set covering problemCombinatorica, 1982
- Cyclic Scheduling via Integer Programs with Circular OnesOperations Research, 1980