Pages that link to "Item:Q1398377"
From MaRDI portal
The following pages link to The lazy bureaucrat scheduling problem (Q1398377):
Displaying 13 items.
- Scheduling algorithms for procrastinators (Q835586) (← links)
- Hardness of lazy packing and covering (Q1015303) (← links)
- 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)
- The many facets of upper domination (Q1704853) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- On lazy bureaucrat scheduling with common deadlines (Q2427440) (← links)
- The maximum resource bin packing problem (Q2508970) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← 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)
