×

Found 128 Documents (Results 1–100)

Geometry meets vectors: approximation algorithms for multidimensional packing. (English) Zbl 07912930

Dawar, Anuj (ed.) et al., 42nd IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2022), IIT Madras, Chennai, India, December 18–20, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 250, Article 23, 22 p. (2022).
MSC:  68N30 68Qxx

Tight approximation algorithms for two-dimensional guillotine strip packing. (English) Zbl 07870290

Bojańczyk, Mikołaj (ed.) et al., 49th EATCS international conference on automata, languages, and programming, ICALP 2022, Paris, France, July 4–8, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 229, Article 80, 20 p. (2022).
MSC:  68Nxx 68Qxx

On the complexity of anchored rectangle packing. (English) Zbl 07525445

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 8, 14 p. (2019).
MSC:  68Wxx
Full Text: DOI

Improved pseudo-polynomial-time approximation for strip packing. (English) Zbl 1393.68189

Lal, Akash (ed.) et al., 36th IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2016), Chennai, India, December 13–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-027-9). LIPIcs – Leibniz International Proceedings in Informatics 65, Article 9, 14 p. (2016).
MSC:  68W25 90C27

Anchored rectangle and square packings. (English) Zbl 1387.68234

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 13, 16 p. (2016).
MSC:  68U05 68W25

Improved approximation algorithm for two-dimensional bin packing. (English) Zbl 1422.68290

Chekuri, Chandra (ed.), Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5–7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 13-25 (2014).
MSC:  68W25 90C27
Full Text: DOI

A \((5/3 + \varepsilon )\)-approximation for strip packing. (English) Zbl 1342.68357

Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 475-487 (2011).
MSC:  68W25 90C27

Improved absolute approximation ratios for two-dimensional packing problems. (English) Zbl 1255.68304

Dinur, Irit (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03684-2/pbk). Lecture Notes in Computer Science 5687, 177-189 (2009).
MSC:  68W25 90C27 90C59
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software