Pages that link to "Item:Q3467873"
From MaRDI portal
The following pages link to Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873):
Displaying 8 items.
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- Minimizing branching vertices in distance-preserving subgraphs (Q2330556) (← links)
- The approximation of maximum subgraph problems (Q4630247) (← links)
- Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms (Q5146796) (← links)
- An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q5220466) (← links)
- Algorithms – ESA 2005 (Q5475891) (← links)
- Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. (Q6075929) (← links)