Pages that link to "Item:Q1888170"
From MaRDI portal
The following pages link to Pipage rounding: a new method of constructing algorithms with proven performance guarantee (Q1888170):
Displaying 7 items.
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
- The complexity of bottleneck labeled graph problems (Q5961969) (← links)
- Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607) (← links)
- Distributed strategy selection: a submodular set function maximization approach (Q6110260) (← links)
- The preemptive resource allocation problem (Q6547132) (← links)
- Approximating weighted completion time via stronger negative correlation (Q6620463) (← links)
- Improved FPT approximation scheme and approximate kernel for biclique-free max \(k\)-weight SAT: greedy strikes back (Q6664061) (← links)