Pages that link to "Item:Q3771608"

The following pages link to Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608):

Displaying 50 items.

• APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM (Q4923297) (← links)
• Hitting and Piercing Rectangles Induced by a Point Set (Q4925240) (← links)
• On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains (Q4973240) (← links)
• Analysis of a first-fit algorithm for the capacitated unit covering problem (Q4976332) (← links)
• A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure (Q5023088) (← links)
• On approximating MIS over B1-VPG graphs* (Q5057743) (← links)
• (Q5075746) (← links)
• On Locality-Sensitive Orderings and Their Applications (Q5090394) (← links)
• (Q5091070) (← links)
• Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
• On Partial Covering For Geometric Set Systems (Q5115815) (← links)
• Identifying Fixations in Gaze Data via Inner Density and Optimization (Q5139607) (← links)
• On capacitated covering with unit balls (Q5266149) (← links)
• Evaluation of Labeling Strategies for Rotating Maps (Q5266612) (← links)
• ON THE DISCRETE UNIT DISK COVER PROBLEM (Q5300002) (← links)
• Approximating the Spanning k-Tree Forest Problem (Q5321721) (← links)
• A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM (Q5322316) (← links)
• Optimization of Packetization Masks for Image Coding Based on an Objective Cost Function for Desired Packet Spreading (Q5365756) (← links)
• Covering Points by Unit Disks of Fixed Location (Q5387798) (← links)
• Domination in Geometric Intersection Graphs (Q5458576) (← links)
• (Q5743499) (← links)
• (Q5874486) (← links)
• The Maximum Exposure Problem. (Q5875471) (← links)
• Many disjoint edges in topological graphs (Q5890932) (← links)
• Covering segments with unit squares (Q5894547) (← links)
• Optimizing active ranges for consistent dynamic map labeling (Q5902232) (← links)
• Disjoint edges in complete topological graphs (Q5917904) (← links)
• Maximum independent and disjoint coverage (Q5918798) (← links)
• Covering and packing of rectilinear subdivision (Q5918965) (← links)
• Online unit covering in Euclidean space (Q5919348) (← links)
• Many disjoint edges in topological graphs (Q5919826) (← links)
• Covering uncertain points in a tree (Q5920112) (← links)
• Deadline TSP (Q5925174) (← links)
• Approximation algorithms for maximum two-dimensional pattern matching (Q5941062) (← links)
• On point covers of \(c-\)oriented polygons (Q5941498) (← links)
• Approximations for Steiner trees with minimum number of Steiner points (Q5958113) (← links)
• Tiling with Squares and Packing Dominos in Polynomial Time (Q6051995) (← links)
• Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. (Q6058197) (← links)
• Covering a set of points with a minimum number of equal disks via simulated annealing (Q6097195) (← links)
• Dispersing facilities on planar segment and circle amidst repulsion (Q6112004) (← links)
• Two generalizations of proper coloring: hardness and approximability (Q6168932) (← links)
• Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\) (Q6190006) (← links)
• A survey on variant domination problems in geometric intersection graphs (Q6536206) (← links)
• Improved algorithms for minimum-membership geometric set cover (Q6547827) (← links)
• Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)
• A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)
• An impossible combinatorial counting method in distance geometry (Q6558675) (← links)
• Approximation algorithms for maximum weighted target cover problem with distance limitations (Q6571268) (← links)
• A PTAS for the horizontal rectangle stabbing problem (Q6589763) (← links)
• PTAS for minimum cost multicovering with disks (Q6593767) (← links)