Pages that link to "Item:Q4376979"
From MaRDI portal
The following pages link to On-line routing of virtual circuits with applications to load balancing and machine scheduling (Q4376979):
Displayed 50 items.
- How to allocate goods in an online market? (Q262246) (← links)
- Competitive and deterministic embeddings of virtual networks (Q391268) (← links)
- Fair online load balancing (Q398848) (← links)
- Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
- Smoothed performance guarantees for local search (Q403643) (← links)
- Coordination mechanisms with hybrid local policies (Q408369) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Performance guarantees for scheduling algorithms under perturbed machine speeds (Q496438) (← links)
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- Online and semi-online hierarchical scheduling for load balancing on uniform machines (Q631770) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- Scheduling of online compute-intensive synchronized jobs on high performance virtual clusters (Q730496) (← links)
- Randomized algorithms for online bounded bidding (Q763539) (← links)
- Scheduling MapReduce jobs on identical and unrelated processors (Q778521) (← links)
- On-line service scheduling (Q835637) (← links)
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- Online algorithms for scheduling with machine activation cost on two uniform machines (Q886402) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- The hierarchical model for load balancing on two machines (Q927189) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Performance of service policies in a specialized service system with parallel servers (Q940910) (← links)
- Deterministic monotone algorithms for scheduling on related machines (Q952439) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- Price of anarchy in parallel processing (Q991788) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- Online scheduling with general machine cost functions (Q1026108) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- New algorithms for related machines with temporary jobs. (Q1588054) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
- A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
- Online bin stretching with three bins (Q1702659) (← links)
- Exponential penalty function control of loss networks (Q1769408) (← links)
- Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
- A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
- Worst-case analysis for on-line service policies (Q2268767) (← links)
- Online scheduling of jobs with favorite machines (Q2289948) (← links)
- Improved price of anarchy for machine scheduling games with coordination mechanisms (Q2311122) (← links)
- Online scheduling of moldable parallel tasks (Q2317140) (← links)
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)
- A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations (Q2345465) (← links)
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)