A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network
type: Item
instance of: scholarly article
title: A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network
zbMATH Open document ID: 1402.90139
author: Lina Chen
author: Zhao Zhang
author: Xiaohui Huang
published in: Journal of Combinatorial Optimization
publication date: 2018-07-26T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6910540
zbMATH Keywords: connected \(k\)-path vertex cover
zbMATH Keywords: unit disk graph
zbMATH Keywords: PTAS
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s10878-018-0283-9
OpenAlex ID: W2794918889
cites work: Narrow sieves for parameterized paths and packings
cites work: Minimum \(k\)-path vertex cover
cites work: Fixed-parameter algorithms for Vertex Cover \(P_3\)
cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
cites work: A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover
cites work: A NEW PROOF FOR ZASSENHAUS–GROEMER–OLER INEQUALITY
cites work: PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs
cites work: An inequality in the geometry of numbers
cites work: A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
cites work: A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
cites work: A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
cites work: A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs
cites work: A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks
cites work: A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
cites work: PTAS for minimum \(k\)-path vertex cover in ball graph
Wikidata QID: Q130058266
DOI: 10.1007/S10878-018-0283-9
Recommended article: A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks
Recommended article: PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks
Recommended article: K-Connected Target Coverage Problem in Wireless Sensor Networks
Recommended article: Q5469539
Recommended article: Connected \(K\)-target coverage problem in wireless sensor networks with different observation scenarios
Recommended article: A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
Recommended article: Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks
description: scientific article; zbMATH DE number 6910540