A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network
From MaRDI portal
(Redirected from Publication:724732)
A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network
A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network
Recommendations
- A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks
- PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks
- K-Connected Target Coverage Problem in Wireless Sensor Networks
- An algorithm for minimal connected cover set problem in wireless sensor networks
- Connected K-target coverage problem in wireless sensor networks with different observation scenarios
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
- Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks
Cites work
- A NEW PROOF FOR ZASSENHAUS–GROEMER–OLER INEQUALITY
- A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
- A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
- A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks
- A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
- An inequality in the geometry of numbers
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover
- Approximation schemes for covering and packing problems in image processing and VLSI
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- Minimum \(k\)-path vertex cover
- Narrow sieves for parameterized paths and packings
- PTAS for minimum \(k\)-path vertex cover in ball graph
- PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs
Cited in
(8)- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover
- The k‐path vertex cover: General bounds and chordal graphs
- Approximation algorithm for minimum connected 3-path vertex cover
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs
- Approximation algorithms for minimum weight connected 3-path vertex cover
- PTAS for minimum \(k\)-path vertex cover in ball graph
- A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks
- PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs
This page was built for publication: A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724732)
