Pages that link to "Item:Q3628568"
From MaRDI portal
The following pages link to Approximation Algorithms for Edge-Covering Problem (Q3628568):
Displaying 11 items.
- Edge covering problem under hybrid uncertain environments (Q371513) (← links)
- A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
- Further NP-hard problems for minimal polygon coverings (Q1200939) (← links)
- On approximation algorithm for the edge metric dimension problem (Q2220845) (← links)
- Approximation algorithm for sweep coverage on graph (Q2346569) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- (Q3046493) (← links)
- Approximability of Edge Matching Puzzles (Q3401089) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Constraint solving via fractional edge covers (Q3581534) (← links)
- Efficient algorithms for the edge-cover coloring problem (Q5063668) (← links)