Pages that link to "Item:Q688437"
From MaRDI portal
The following pages link to Approximating the tree and tour covers of a graph (Q688437):
Displaying 30 items.
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- Complexity of the minimum-length corridor problem (Q876503) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- A metaheuristic approach to the dominating tree problem (Q1677304) (← links)
- Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245) (← links)
- Approximating the minimum tour cover of a digraph (Q1736480) (← links)
- Better \(s-t\)-tours by Gao trees (Q1800996) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- Improved approximations for tour and tree covers (Q1879245) (← links)
- On approximation of dominating tree in wireless sensor networks (Q1958639) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- On the tree cover number of a graph (Q2357664) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- A primal-dual method for approximating tree cover with two weights (Q2465937) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- Approximation algorithms for metric tree cover and generalized tour and tree covers (Q3004205) (← links)
- Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
- A Primal-Dual Method for Approximating Tree Cover with Two Weights (Q3439142) (← links)
- Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)
- (Q3584203) (← links)
- Minimum-diameter covering problems (Q4520238) (← links)
- Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph (Q5505664) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints (Q6562874) (← links)