Pages that link to "Item:Q2492706"
From MaRDI portal
The following pages link to A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706):
Displaying 12 items.
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116) (← links)
- Complexity and approximation for traveling salesman problems with profits (Q2441781) (← links)
- On combining machine learning with decision making (Q2512894) (← links)
- Approximating node-weighted \(k\)-MST on planar graphs (Q5918856) (← links)
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem (Q5970779) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)
