Techniques and results on approximation algorithms for packing circles
type: Item
instance of: scholarly article
title: Techniques and results on approximation algorithms for packing circles
author: Flávio K. Miyazawa
author: Yoshiko Wakabayashi
published in: São Paulo Journal of Mathematical Sciences
publication date: 2022-09-30T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 52C17
Mathematics Subject Classification ID: 52C26
zbMATH DE Number: 7595685
zbMATH Keywords: circle packing
zbMATH Keywords: approximation
zbMATH Keywords: bin packing
zbMATH Keywords: strip packing
zbMATH Keywords: knapsack
Wikidata QID: Q121767341
describes a project that uses: kepler98
MaRDI profile type: Publication
full work available at URL: s40863-022-00301-3
OpenAlex ID: W4223423263
cites work: Shelf Algorithms for Two-Dimensional Packing Problems
cites work: On the combinatorial and algebraic complexity of quantifier elimination
cites work: Approximation of geometric dispersion problems
cites work: Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
cites work: Improving dense packings of equal disks in a square
cites work: Research Problems in Discrete Geometry
cites work: Approximation and online algorithms for multidimensional bin packing: a survey
cites work: On Packing Two-Dimensional Bins
cites work: Q3347319
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: Algorithms - ESA 2003
cites work: Two-dimensional online bin packing with rotation
cites work: Q5588434
cites work: Q3218723
cites work: Q5358292
cites work: Q3138753
cites work: Über einen geometrischen Satz
cites work: Q5088965
cites work: Split packing: algorithms for packing circles with optimal worst-case density
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: The densest packing of equal circles into a parallel strip
cites work: Q4133108
cites work: Repeated patterns of dense packings of equal disks in a square
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Solving systems of polynomial inequalities in subexponential time
cites work: A proof of the Kepler conjecture
cites work: A FORMAL PROOF OF THE KEPLER CONJECTURE
cites work: A literature review on circle and sphere packing problems: models and methodologies
cites work: A bounded space algorithm for online circle packing
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Approximation algorithms for combinatorial problems
cites work: Integer Programming with a Fixed Number of Variables
cites work: Two-dimensional knapsack for circles
cites work: Online circle and sphere packing
cites work: Two-dimensional packing problems: a survey
cites work: New results in the packing of equal circles in a square
cites work: Interval methods for verifying structural optimality of circle packing configurations in the unit square
cites work: Improved interval methods for solving circle packing problems in the unit square
cites work: On packing of squares and cubes
cites work: Polynomial-time approximation schemes for circle and other packing problems
cites work: On the online bin packing problem
cites work: New approaches to circle packing in a square. With program codes.
DOI: 10.1007/S40863-022-00301-3
description: scientific article; zbMATH DE number 7595685