Pages that link to "Item:Q3771608"
From MaRDI portal
The following pages link to Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608):
Displaying 50 items.
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245) (← links)
- Maximum lifetime connected coverage with two active-phase sensors (Q2392753) (← links)
- Faster approximation for maximum independent set on unit disk graph (Q2398507) (← links)
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
- A scheme for computing minimum covers within simple regions (Q2428655) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- PERM for solving circle packing problem (Q2459405) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
- New heuristics for packing unequal circles into a circular container (Q2489278) (← links)
- A new heuristic recursive algorithm for the strip rectangular packing problem (Q2489283) (← links)
- On optimal placement of relay nodes for reliable connectivity in wireless sensor networks (Q2498988) (← links)
- Approximation algorithms on consistent dynamic map labeling (Q2629235) (← links)
- On the complexity of some geometric problems in unbounded dimension (Q2638782) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Approximation algorithms for the generalized incremental knapsack problem (Q2687039) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- Sensor Cover and Double Partition (Q2820119) (← links)
- On disjoint crossing families in geometric graphs (Q2857373) (← links)
- An algorithmic framework for solving geometric covering problems -- with applications (Q2929639) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- Covering Polygons with Rectangles (Q2988828) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- On the Discrete Unit Disk Cover Problem (Q3078392) (← links)
- Grid scheduling by on-line rectangle packing (Q3156825) (← links)
- A Scheme for Computing Minimum Covers within Simple Regions (Q3183475) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q3304732) (← links)
- A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS (Q3397517) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Linear-Time Approximation Algorithms for Unit Disk Graphs (Q3453289) (← links)
- Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory (Q3455753) (← links)
- Minimum Dominating Set Problem for Unit Disks Revisited (Q3459050) (← links)
- PACKING A TRUCK — NOW WITH A TWIST! (Q3503017) (← links)
- Spectrum Bidding in Wireless Networks and Related (Q3511367) (← links)
- On Covering Problems of Rado (Q3512467) (← links)
- Stabbing Convex Polygons with a Segment or a Polygon (Q3541074) (← links)
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (Q3560062) (← links)
- MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS (Q3562849) (← links)
- ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS (Q3634205) (← links)
- Latency Constrained Aggregation in Chain Networks Admits a PTAS (Q3638456) (← links)
- Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
- ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE (Q4581438) (← links)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
- Discrete unit square cover problem (Q4644781) (← links)
