Pages that link to "Item:Q2842783"
From MaRDI portal
The following pages link to The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design (Q2842783):
Displaying 7 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)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
