Pages that link to "Item:Q2581009"
From MaRDI portal
The following pages link to Improved approximations for weighted and unweighted graph problems (Q2581009):
Displaying 4 items.
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- On-line models and algorithms for max independent set (Q3411297) (← links)
