Pages that link to "Item:Q6487957"
From MaRDI portal
The following pages link to Greedy approximations of independent sets in low degree graphs (Q6487957):
Displaying 15 items.
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Performance analysis of greedy algorithms for Max-IS and Min-Maxl-Match (Q1002430) (← links)
- On approximation properties of the independent set problem for low degree graphs (Q1281930) (← links)
- Approximability results for stable marriage problems with ties. (Q1426466) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- Greed is good: approximating independent sets in sparse and bounded-degree graphs (Q2817635) (← links)
- (Q3479822) (← links)
- (Q3980035) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q5146864) (← links)
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)
- Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs (Q6648269) (← links)