Pages that link to "Item:Q2392763"
From MaRDI portal
The following pages link to PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs (Q2392763):
Displaying 22 items.
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks (Q512868) (← links)
- A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network (Q724732) (← links)
- PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- Solving the multistage PMU placement problem by integer programming and equivalent network design model (Q2423817) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) (← links)
- A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs (Q2512658) (← links)
- Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem (Q2942448) (← links)
- Theory and application of reciprocal transformation of “path problem” and “time float problem” (Q2969956) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs (Q3569890) (← links)
- (Q5225203) (← links)
- Approximation and Online Algorithms (Q5898481) (← links)