AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (Q3560062): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Improved approximation algorithms for geometric set cover / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Homogeneous 2-hop broadcast in 2D / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal packing and covering in the plane are NP-complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering a set of points in multidimensional space / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-completeness column: An ongoing guide / rank | |||
Normal rank | |||
Revision as of 20:47, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER |
scientific article |
Statements
AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (English)
0 references
19 May 2010
0 references
discrete unit disk cover
0 references
approximation algorithm
0 references
disk stabbing
0 references
