The following pages link to (Q3128890):
Displaying 36 items.
- Online scheduling of jobs with fixed start times on related machines (Q261353) (← links)
- Online scheduling with interval conflicts (Q372978) (← links)
- Online selection of intervals and \(t\)-intervals (Q391644) (← links)
- On-line scheduling of equal-length intervals on parallel machines (Q436333) (← links)
- Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines (Q632642) (← links)
- Lower bounds for two call control problems (Q672266) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- Scheduling to maximize participation (Q935466) (← links)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- Deterministic on-line call control in cellular networks (Q982658) (← links)
- Online interval scheduling: Randomized and multiprocessor cases (Q1029703) (← links)
- Efficient delay routing (Q1128715) (← links)
- Competitive video on demand schedulers for popular movies (Q1399108) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- Competitive on-line scheduling of continuous-media streams (Q1608317) (← links)
- Scheduling multipacket frames with frame deadlines (Q1702660) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- Improved randomized online scheduling of intervals and jobs (Q2254495) (← links)
- Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints (Q2392745) (← links)
- Online scheduling of bounded length jobs to maximize throughput (Q2434304) (← links)
- Admission control with advance reservations in simple networks (Q2466012) (← links)
- Call admission problems on trees (Q2672603) (← links)
- An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead (Q2788528) (← links)
- Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints (Q3004685) (← links)
- Disjoint Path Allocation with Sublinear Advice (Q3196403) (← links)
- Scheduling Multipacket Frames with Frame Deadlines (Q3460708) (← links)
- A Randomized Algorithm for Online Scheduling with Interval Conflicts (Q3460709) (← links)
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (Q3512469) (← links)
- Competitive algorithms and lower bounds for online randomized call control in cellular networks (Q3548724) (← links)
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs (Q3602829) (← links)
- Scheduling to Maximize Participation (Q3608460) (← links)
- (Q4267395) (← links)
- On-line routing in all-optical networks (Q4571982) (← links)
- On-line resource management with applications to routing and scheduling (Q4645187) (← links)
- On-line scheduling with hard deadlines (Q5096944) (← links)
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. (Q6058197) (← links)
