Pages that link to "Item:Q1028454"
From MaRDI portal
The following pages link to Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454):
Displaying 15 items.
- Efficient computation of tolerances in the weighted independent set problem for trees (Q378171) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Approximating weighted neighborhood independent sets (Q1679903) (← links)
- A new distributed approximation algorithm for the maximum weight independent set problem (Q1793873) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm (Q2930345) (← links)
- Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs (Q2946027) (← links)
- Approximations of Weighted Independent Set and Hereditary Subset Problems (Q4504997) (← links)
- (Q4938668) (← links)
- (Q5075740) (← links)
- (Q5109886) (← links)
- Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary (Q5146946) (← links)
- (Q5417623) (← links)
- Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs (Q6648269) (← links)