Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (Q2453164): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2120272254 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1204.3488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding fixed-radius near neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graph recognition is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5824053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The densest packing of 13 congruent circles in a circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier / 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: Approximating minimum independent dominating sets in wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Independence and Domination on Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer realizations of disk and segment graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for weighted matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs / rank
 
Normal rank

Latest revision as of 13:53, 8 July 2024

scientific article
Language Label Description Also known as
English
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
scientific article

    Statements

    Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (English)
    0 references
    0 references
    6 June 2014
    0 references
    approximation algorithms
    0 references
    dominating set
    0 references
    unit disk graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references