Parameterized Complexity of Directed Spanner Problems.
From MaRDI portal
Publication:6089656
Recommendations
Cites work
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- Additive graph spanners
- An FPT Algorithm for Minimum Additive Spanner Problem.
- An Optimal Synchronizer for the Hypercube
- Approximating spanners and directed Steiner forest: upper and lower bounds
- Fundamentals of parameterized complexity
- Graph spanners
- Kernelization. Theory of parameterized preprocessing
- NP-completeness of minimum spanner problems
- NP-hardness and fixed-parameter tractability of the minimum spanner problem
- On the hardness of approximating spanners
- Parameterized algorithms
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Roundtrip spanners and roundtrip routing in directed graphs
Cited in
(4)
This page was built for publication: Parameterized Complexity of Directed Spanner Problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089656)