Pages that link to "Item:Q5945922"
From MaRDI portal
The following pages link to On the hardness of approximating spanners (Q5945922):
Displaying 40 items.
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- The checkpoint problem (Q714790) (← links)
- The ordered covering problem (Q722532) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- Approximating the minimal sensor selection for supervisory control (Q853685) (← links)
- Power optimization for connectivity problems (Q877193) (← links)
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems (Q924541) (← links)
- Complete partitions of graphs (Q949754) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
- A note on the subadditive network design problem (Q1038103) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Parameterized complexity of directed spanner problems (Q2161008) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- On tree-constrained matchings and generalizations (Q2258075) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- (Q2728855) (← links)
- (Q2754183) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- On Tree-Constrained Matchings and Generalizations (Q3012795) (← links)
- Network flow spanners (Q3057178) (← links)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- Generating Sparse 2-Spanners (Q4312222) (← links)
- (Q4537738) (← links)
- Towards minimum<i>k</i>-geodetically connected graphs (Q4804165) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Generating sparse 2—spanners (Q5056130) (← links)
- Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs (Q5130515) (← links)
- Distance-Preserving Graph Contractions (Q5233754) (← links)
- (Q5875462) (← links)
- Parameterized Complexity of Directed Spanner Problems. (Q6089656) (← links)
