Approximation algorithms for the connected sensor cover problem (Q2290655): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The relation of connected set cover and group Steiner tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simple heuristics for unit disk graphs / rank | |||
Normal rank | |||
Revision as of 14:09, 21 July 2024
scientific article; zbMATH DE number 6501916
- Approximation Algorithms for the Connected Sensor Cover Problem
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for the connected sensor cover problem |
scientific article; zbMATH DE number 6501916 |
|
Statements
Approximation algorithms for the connected sensor cover problem (English)
0 references
Approximation Algorithms for the Connected Sensor Cover Problem (English)
0 references
29 January 2020
0 references
29 October 2015
0 references
approximation algorithms
0 references
sensor cover
0 references
Steiner tree
0 references
hitting set
0 references
computational geometry
0 references
0 references
0 references
0 references
0 references
0 references
0 references
