Pages that link to "Item:Q1426727"
From MaRDI portal
The following pages link to A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727):
Displayed 16 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- Implicit cover inequalities (Q266036) (← links)
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438) (← links)
- The subdivision-constrained minimum spanning tree problem (Q1006063) (← links)
- A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
- Approximate Pareto sets of minimal size for multi-objective optimization problems (Q1785308) (← links)
- Exact algorithms for finding constrained minimum spanning trees (Q2082219) (← links)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- A Survey on Multiple Objective Minimum Spanning Tree Problems (Q3637314) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)