The following pages link to (Q4395327):
Displaying 22 items.
- On the approximability of dense Steiner problems (Q396661) (← links)
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Approximation complexity of metric dimension problem (Q450564) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Connected vertex covers in dense graphs (Q974753) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- A taxonomy for emergency service station location problem (Q1758059) (← links)
- Approximating the dense set-cover problem (Q1765297) (← links)
- An approximation of the minimum vertex cover in a graph (Q2258357) (← links)
- Density, forcing, and the covering problem (Q2355765) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- The connected vertex cover problem in \(k\)-regular graphs (Q2424831) (← links)
- On the average-case complexity of pattern matching with wildcards (Q2672571) (← links)
- Approximating subdense instances of covering problems (Q2840726) (← links)
- On Approximation Complexity of Metric Dimension Problem (Q3000502) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
- On point covers of \(c-\)oriented polygons (Q5941498) (← links)
