Algorithms for dominating set in disk graphs: breaking the \(\log n\) barrier (extended abstract) (Q3586466)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5779779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for dominating set in disk graphs: breaking the \(\log n\) barrier (extended abstract) |
scientific article; zbMATH DE number 5779779 |
Statements
Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier (English)
0 references
6 September 2010
0 references
0.8530213236808777
0 references
0.845645010471344
0 references
0.8291179537773132
0 references
0.8279483914375305
0 references
0.8278189301490784
0 references
