Pages that link to "Item:Q5054761"
From MaRDI portal
The following pages link to Improved approximations of independent sets in bounded-degree graphs (Q5054761):
Displaying 16 items.
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem (Q1195856) (← links)
- On approximation properties of the independent set problem for low degree graphs (Q1281930) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Greed is good: approximating independent sets in sparse and bounded-degree graphs (Q2817635) (← links)
- Improved approximations of independent sets in bounded-degree graphs via subgraph removal (Q4698692) (← links)
- (Q4845153) (← links)
- On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)
- Further Improvement on Maximum Independent Set in Degree-4 Graphs (Q5199148) (← links)
- Structural Information and Communication Complexity (Q5315241) (← links)
- Simple and local independent set approximation (Q5919021) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
- Greedy approximations of independent sets in low degree graphs (Q6487957) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)
