A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks (Q512868): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Li-Min Wang / rank
Normal rank
 
Property / author
 
Property / author: Li-Min Wang / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6691086 / rank
 
Normal rank
Property / zbMATH Keywords
 
PTAS
Property / zbMATH Keywords: PTAS / rank
 
Normal rank
Property / zbMATH Keywords
 
connected vertex cover \(P_3\)
Property / zbMATH Keywords: connected vertex cover \(P_3\) / rank
 
Normal rank
Property / zbMATH Keywords
 
smooth weights
Property / zbMATH Keywords: smooth weights / rank
 
Normal rank
Property / zbMATH Keywords
 
weak \(c\)-local
Property / zbMATH Keywords: weak \(c\)-local / rank
 
Normal rank
Property / zbMATH Keywords
 
unit ball graph
Property / zbMATH Keywords: unit ball graph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-015-9937-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2179466049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / 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: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and analysis of approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the vertex cover \(P^3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for some Steiner tree problems in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sphere packings. (Edited by John Talbot) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:52, 13 July 2024

scientific article
Language Label Description Also known as
English
A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks
scientific article

    Statements

    A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    PTAS
    0 references
    connected vertex cover \(P_3\)
    0 references
    smooth weights
    0 references
    weak \(c\)-local
    0 references
    unit ball graph
    0 references

    Identifiers