The following pages link to Algorithms and Computation (Q5191669):
Displaying 8 items.
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- Maximum matching and kernelization of edge dominating set (Q1751411) (← links)
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem (Q1944924) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- Approximability of Edge Matching Puzzles (Q3401089) (← links)
