Pages that link to "Item:Q2464336"
From MaRDI portal
The following pages link to The hardness of approximating spanner problems (Q2464336):
Displayed 16 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Graph spanners: a tutorial review (Q2026289) (← 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)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- (Q5091070) (← links)
- (Q5875462) (← links)