Pages that link to "Item:Q4691776"
From MaRDI portal
The following pages link to Approximation algorithms for graph approximation problems (Q4691776):
Displaying 11 items.
- Approximation algorithms for fragmenting a graph against a stochastically-located threat (Q2344215) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- (Q2753729) (← links)
- A PTAS for the Cluster Editing Problem on Planar Graphs (Q2971154) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- Approximating the Restricted 1-Center in Graphs (Q3467877) (← links)
- (Q5075776) (← links)
- A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs (Q5301387) (← links)
- Approximation Algorithms and Hardness Results for Labeled Connectivity Problems (Q5756701) (← links)
- Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. (Q6075929) (← links)
- Approximation algorithms in graphs with known broadcast time of the base graph (Q6102286) (← links)