Pages that link to "Item:Q1861582"
From MaRDI portal
The following pages link to A note on greedy algorithms for the maximum weighted independent set problem (Q1861582):
Displayed 5 items.
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- An exact algorithm for MAX-CUT in sparse graphs (Q2467485) (← links)
- Data dependent worst case bounds for weighted set packing (Q2484341) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)