Pages that link to "Item:Q1770405"
From MaRDI portal
The following pages link to On the differential approximation of MIN SET COVER (Q1770405):
Displaying 15 items.
- A survey on the structure of approximation classes (Q458503) (← links)
- Preserving approximation in the min-weighted set cover problem (Q674914) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- An algorithm for the difference between set covers (Q944712) (← links)
- New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
- Equivalent characterizations of some graph problems by covering-based rough sets (Q2375570) (← links)
- The complexity of minimum difference cover (Q2458927) (← links)
- (Q4411280) (← links)
- Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa (Q4831416) (← links)
- (Q4843442) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711562) (← links)