Pages that link to "Item:Q5905224"
From MaRDI portal
The following pages link to The NP-completeness column: An ongoing guide (Q5905224):
Displaying 25 items.
- Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas (Q287635) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- Diameter partitioning (Q1076974) (← links)
- Unit disk graphs (Q1174134) (← links)
- Covering a set of points in multidimensional space (Q1183467) (← links)
- Watchman routes under limited visibility (Q1188285) (← links)
- Approximating uniform triangular meshes in polygons. (Q1853569) (← links)
- Pattern minimisation in cutting stock problems (Q1961237) (← links)
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
- Density-based O-Means clustering algorithm using minimum spanning tree (Q2833282) (← links)
- A novel dynamic minimum spanning tree based clustering method for image mining (Q2895977) (← links)
- Abductive Reasoning in 2D Geospatial Problems (Q2926149) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- On the Discrete Unit Disk Cover Problem (Q3078392) (← links)
- A Scheme for Computing Minimum Covers within Simple Regions (Q3183475) (← links)
- Minimum Dominating Set Problem for Unit Disks Revisited (Q3459050) (← links)
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (Q3560062) (← links)
- THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS (Q3632030) (← links)
- Minimum-diameter covering problems (Q4520238) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- ON THE DISCRETE UNIT DISK COVER PROBLEM (Q5300002) (← links)
- Covering Points by Unit Disks of Fixed Location (Q5387798) (← links)
