Pages that link to "Item:Q5167791"
From MaRDI portal
The following pages link to Parameterized Approximation Schemes Using Graph Widths (Q5167791):
Displaying 16 items.
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Sublinear-time algorithms for approximating graph parameters (Q2075766) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
- Parameterized Power Vertex Cover (Q3181050) (← links)
- Reduction Techniques for Graph Isomorphism in the Context of Width Parameters (Q3188910) (← links)
- Parameterized (approximate) defective coloring (Q3304104) (← links)
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices (Q3304124) (← links)
- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- (Q5136270) (← links)
- (Q5874334) (← links)