Pages that link to "Item:Q1602708"
From MaRDI portal
The following pages link to Approximation algorithms for multi-parameter graph optimization problems (Q1602708):
Displaying 12 items.
- Multistage graph problems on a global budget (Q831134) (← links)
- Interval-parameter optimization problems on graphs (Q1040365) (← links)
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722) (← links)
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727) (← links)
- An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (Q2383757) (← links)
- On the typical case complexity of graph optimization (Q2581548) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization (Q2867073) (← links)
- Parameterized Approximation Schemes Using Graph Widths (Q5167791) (← links)
- Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size (Q5171158) (← links)
- Algorithms and Computation (Q5191683) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
