Approximation schemes for covering and packing problems in image processing and VLSI
From MaRDI portal
covering points in the Euclidean spaceimage processingpackingpolynomial approximation schemesshifting strategystrongly NP-complete problemsVLSIworst case analysis of heuristics
Combinatorial aspects of packing and covering (05B40) Lattice packing and covering (number-theoretic aspects) (11H31) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Analysis of algorithms and problem complexity (68Q25) Applications of design theory to circuits and networks (94C30)
Recommendations
- scientific article; zbMATH DE number 3888915
- Approximation algorithms for NP-complete problems on planar graphs
- Fast approximation algorithms for a nonconvex covering problem
- Complexities of efficient solutions of rectilinear polygon cover problems
- Close approximations of minimum rectangular coverings
Cites work
- A beam search algorithm for the circular packing problem
- A dynamic adaptive local search algorithm for the circular packing problem
- A literature review on circle and sphere packing problems: models and methodologies
- A short note on a simple search heuristic for the diskspacking problem
- Adaptive beam search lookahead algorithms for the circular packing problem
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Approximation schemes for covering and packing problems in image processing and VLSI
- Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints
- Efficiently packing unequal disks in a circle
- Generating optimal T-shape cutting patterns for circular blanks
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Integrated container loading software for pulp and paper industry
- New heuristics for packing unequal circles into a circular container
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- PERM for solving circle packing problem
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving the problem of packing equal and unequal circles in a circular container
- Tabu search -- uncharted domains
- Tabu Search—Part I
- Two personification strategies for solving circles packing problem
Cited in
(only showing first 100 items - show all)- A note on maximum independent sets in rectangle intersection graphs
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
- A better constant-factor approximation for weighted dominating set in unit disk graph
- An improved algorithm for online unit clustering
- Approximation algorithms for hitting objects with straight lines
- Finding a minimal cover for binary images: An optimal parallel algorithm
- Covering a set of points in multidimensional space
- A basic algorithm for computer-aided design of material arrangement
- Hierarchically specified unit disk graphs
- Label placement by maximum independent set in rectangles
- An optimal algorithm for solving collision distance between convex polygons in plane
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Fast stabbing of boxes in high dimensions
- Approximability and hardness of geometric hitting set with axis-parallel rectangles
- An improved approximation algorithm for the discrete Fréchet distance
- Winner determination in geometrical combinatorial auctions
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
- Near-linear time approximation schemes for geometric maximum coverage
- Exact and approximation algorithms for geometric and capacitated set cover problems
- The complexity of base station positioning in cellular networks
- Smooth kinetic maintenance of clusters
- An improved algorithm for the packing of unequal circles within a larger containing circle
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Approximating uniform triangular meshes in polygons.
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
- Approximation algorithms for aligning points
- Almost optimal set covers in finite VC-dimension
- Trimming of graphs, with application to point labeling
- Two personification strategies for solving circles packing problem
- An exact algorithm for a class of geometric set-cover problems
- Experiments with unit disk cover algorithms for covering massive pointsets
- Approximation algorithm for minimum partial multi-cover under a geometric setting
- The maximum exposure problem
- Weighted geometric set cover with rectangles of bounded integer side lengths
- Online unit clustering and unit covering in higher dimensions
- Parallel algorithm for minimum partial dominating set in unit disk graph
- A PTAS for the horizontal rectangle stabbing problem
- Efficient independent set approximation in unit disk graphs
- Capacitated covering problems in geometric spaces
- Liar's dominating set problem on unit disk graphs
- On grids in topological graphs
- Minimum vertex cover in ball graphs through local search
- A 4.31-approximation for the geometric unique coverage problem on unit disks
- Optimization for first order Delaunay triangulations
- Range assignment of base-stations maximizing coverage area without interference
- The most points connected-covering problem with two disks
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
- Clique partitioning with value-monotone submodular cost
- Geometric red-blue set cover for unit squares and related problems
- Shortest paths in intersection graphs of unit disks
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Maximum lifetime connected coverage with two active-phase sensors
- Faster approximation for maximum independent set on unit disk graph
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms
- A scheme for computing minimum covers within simple regions
- A weakly robust PTAS for minimum clique partition in unit disk graphs
- Near-linear approximation algorithms for geometric hitting sets
- A PTAS for the cardinality constrained covering with unit balls
- PERM for solving circle packing problem
- Improper colouring of (random) unit disk graphs
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
- New heuristics for packing unequal circles into a circular container
- A new heuristic recursive algorithm for the strip rectangular packing problem
- On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
- Approximation algorithms on consistent dynamic map labeling
- On the complexity of some geometric problems in unbounded dimension
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
- Approximation algorithms for the generalized incremental knapsack problem
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
- Improved algorithm for maximum independent set on unit disk graph
- Sensor cover and double partition
- On disjoint crossing families in geometric graphs
- Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas
- An algorithmic framework for solving geometric covering problems -- with applications
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
- Covering polygons with rectangles
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
- On the discrete unit disk cover problem
- Grid scheduling by on-line rectangle packing
- A Scheme for Computing Minimum Covers within Simple Regions
- Linear Time Approximation Schemes for Geometric Maximum Coverage
- scientific article; zbMATH DE number 3888915 (Why is no real title available?)
- On locality-sensitive orderings and their applications
- scientific article; zbMATH DE number 4215407 (Why is no real title available?)
- A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
- An AFPTAS for variable sized bin packing with general activation costs
- A PTAS for the Weighted Unit Disk Cover Problem
- Linear-time approximation algorithms for unit disk graphs
- Algorithms for Steiner connected dominating set problem based on learning automata theory
- Minimum dominating set problem for unit disks revisited
- PACKING A TRUCK — NOW WITH A TWIST!
- Spectrum Bidding in Wireless Networks and Related
- On Covering Problems of Rado
- Stabbing Convex Polygons with a Segment or a Polygon
- An improved line-separable algorithm for discrete unit disk cover
- Maximum area independent sets in disk intersection graphs
This page was built for publication: Approximation schemes for covering and packing problems in image processing and VLSI
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771608)
