The following pages link to The Lazy Matroid Problem (Q3190151):
Displaying 4 items.
- Subset sum problems with digraph constraints (Q1631654) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- Online lazy bureaucrat scheduling with a machine deadline (Q1702835) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)