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.
- Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas (Q287635) (← links)
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang (Q306089) (← links)
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- Relay node placement in two-tiered wireless sensor networks with base stations (Q385493) (← links)
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Approximation algorithms for free-label maximization (Q419365) (← links)
- Covering moving points with anchored disks (Q421753) (← links)
- Radar placement along banks of river (Q427395) (← links)
- Minimum covering with travel cost (Q454247) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- Coloring intersection graphs of \(x\)-monotone curves in the plane (Q485004) (← links)
- Unit disk cover problem in 2D (Q491638) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- Approximation algorithms for the unit disk cover problem in 2D and 3D (Q680146) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- An improved approximation algorithm for the most points covering problem (Q692901) (← links)
- Local approximability of max-min and min-max linear programs (Q693753) (← links)
- Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
- A clustering-based approach to kinetic closest pair (Q722518) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network (Q724732) (← links)
- Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- Robustness of regional matching scheme over global matching scheme (Q814437) (← links)
- Approximation schemes for the generalized extensible bin packing problem (Q832515) (← links)
- A randomized algorithm for online unit clustering (Q839627) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- The inverse protein folding problem on 2D and 3D lattices (Q876470) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
- Minimum-energy broadcast and disk cover in grid wireless networks (Q930903) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- Covering a line segment with variable radius discs (Q960389) (← links)
- On covering problems of Rado (Q970613) (← links)
- A note on maximum independent sets in rectangle intersection graphs (Q1029038) (← links)
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks (Q1037372) (← links)
- A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452) (← links)
- An improved algorithm for online unit clustering (Q1040649) (← links)
