A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-008-9146-0 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation problems related to the independent set and vertex cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev's approximation algorithms and applications / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-008-9146-0 / rank
 
Normal rank

Latest revision as of 14:15, 10 December 2024

scientific article
Language Label Description Also known as
English
A better constant-factor approximation for weighted dominating set in unit disk graph
scientific article

    Statements

    Identifiers