The following pages link to György Dósa (Q301138):
Displaying 50 items.
- Bin covering with a general profit function: approximability results (Q301139) (← links)
- (Q385495) (redirect page) (← links)
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- 2D knapsack: packing squares (Q388093) (← links)
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (Q392175) (← links)
- The generalization of scheduling with machine cost (Q392182) (← links)
- New upper and lower bounds for online scheduling with machine cost (Q429648) (← links)
- On the absolute approximation ratio for first fit and related results (Q442205) (← links)
- Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212) (← links)
- Online scheduling with rearrangement on two related machines (Q627161) (← links)
- Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← links)
- Online scheduling with a buffer on related machines (Q711400) (← links)
- (Q817018) (redirect page) (← links)
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines (Q817020) (← links)
- On the machine scheduling problem with job delivery coordination (Q884029) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- Extension of algorithm list scheduling for a semi-online scheduling problem (Q1011847) (← links)
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- Colored bin packing: online algorithms and lower bounds (Q1702125) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- The optimal absolute ratio for online bin packing (Q1741486) (← links)
- The intermediate price of anarchy (IPoA) in bin packing games (Q1744237) (← links)
- A general bin packing game: interest taken into account (Q1750357) (← links)
- Lower bound for 3-batched bin packing (Q1751161) (← links)
- Bin packing games with weight decision: how to get a small value for the price of anarchy (Q1757770) (← links)
- Semi-online algorithms for parallel machine scheduling problems (Q1885287) (← links)
- Semi-online hierarchical scheduling problems with buffer or rearrangements (Q1943630) (← links)
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← links)
- A new heuristic and an exact approach for a production planning problem (Q2051214) (← links)
- A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays (Q2060394) (← links)
- Guillotine cutting is asymptotically optimal for packing consecutive squares (Q2091225) (← links)
- Lower bounds for batched bin packing (Q2125232) (← links)
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← links)
- Online bin packing with cardinality constraints resolved (Q2186811) (← links)
- Quality of equilibria for selfish bin packing with cost sharing variants (Q2218642) (← links)
- A new lower bound on the price of anarchy of selfish bin packing (Q2274500) (← links)
- Quality of strong equilibria for selfish bin packing with uniform cost sharing (Q2304118) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Online results for black and white bin packing (Q2344213) (← links)
- Offline black and white bin packing (Q2355707) (← links)
- The tight absolute bound of First Fit in the parameterized case (Q2355708) (← links)
- Scheduling with machine cost and rejection (Q2385470) (← links)
- A note on a selfish bin packing problem (Q2393075) (← links)
- Batched bin packing revisited (Q2398649) (← links)
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing (Q2424651) (← links)
- Using weight decision for decreasing the price of anarchy in selfish bin packing games (Q2424774) (← links)
- Bin packing problems with rejection penalties and their dual problems (Q2495654) (← links)
