The following pages link to (Q3337224):
Displayed 6 items.
- A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach (Q671377) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)