Pages that link to "Item:Q3192029"
From MaRDI portal
The following pages link to A guessing game and randomized online algorithms (Q3192029):
Displayed 9 items.
- On the remote server problem or more about TCP acknowledgments (Q861268) (← links)
- New lower bounds for online \(k\)-server routing problems (Q987824) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- Online scheduling with general machine cost functions (Q1026108) (← links)
- News from the online traveling repairman. (Q1401247) (← links)
- Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← links)
- Preemptive online algorithms for scheduling with machine cost (Q1777224) (← links)
- Two short notes on the on-line travelling salesman: handling times and lookahead. (Q1853561) (← links)
- Online scheduling with machine cost and rejection (Q2462392) (← links)