Pages that link to "Item:Q3128992"

The following pages link to Efficient On-Line Call Control Algorithms (Q3128992):

Displaying 22 items.

• Online time-constrained scheduling in linear and ring networks (Q616984) (← links)
• Lower bounds for two call control problems (Q672266) (← links)
• Scheduling to maximize participation (Q935466) (← links)
• A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
• Competitive video on demand schedulers for popular movies (Q1399108) (← links)
• Competitive on-line scheduling of continuous-media streams (Q1608317) (← links)
• Improved bounds for randomized preemptive online matching (Q1706142) (← links)
• Call control with \(k\) rejections (Q1877703) (← links)
• On-line randomized call control revisited (Q2719132) (← links)
• Distributed online call control on general networks (Q2921742) (← links)
• Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820) (← links)
• A Randomized Algorithm for Online Scheduling with Interval Conflicts (Q3460709) (← links)
• A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (Q3512469) (← links)
• (Q4250198) (← links)
• On-line resource management with applications to routing and scheduling (Q4645187) (← links)
• (Q4856753) (← links)
• (Q5090507) (← links)
• On-line scheduling with hard deadlines (Q5096944) (← links)
• Algorithms and Data Structures (Q5900753) (← links)
• Relaxing the irrevocability requirement for online graph algorithms (Q5918715) (← links)
• Competitive routing of virtual circuits with unknown duration (Q5943097) (← links)
• Any-order online interval selection (Q6574946) (← links)