The following pages link to (Q4952604):
Displaying 8 items.
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs (Q487021) (← links)
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
- Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- Incremental medians via online bidding (Q2482726) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Facility Location Problems: A Parameterized View (Q3511428) (← links)
- Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint (Q5024901) (← links)
