The following pages link to (Q4829007):
Displaying 11 items.
- Bi-objective matchings with the triangle inequality (Q515541) (← links)
- Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← links)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- Trading off worst and expected cost in decision tree problems (Q1679235) (← links)
- Two dimensional load balancing (Q1785303) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← links)
- Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness (Q2479534) (← links)
- The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem (Q2499589) (← links)
- A note on scheduling to meet two min-sum objectives (Q2643821) (← links)
