Pages that link to "Item:Q760210"
From MaRDI portal
The following pages link to On approximation problems related to the independent set and vertex cover problems (Q760210):
Displaying 13 items.
- On the computational complexity of measuring global stability of banking networks (Q487019) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph (Q1006048) (← links)
- A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452) (← links)
- On approximation properties of the independent set problem for low degree graphs (Q1281930) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms (Q4608072) (← links)
- Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa (Q4831416) (← links)
- (Q4938668) (← links)
- (Q5005166) (← links)
- On locally optimal independent sets and vertex covers (Q5687646) (← links)
