Randomized priority algorithms
From MaRDI portal
Publication:974749
DOI10.1016/J.TCS.2010.03.014zbMATH Open1203.68312OpenAlexW2120954276MaRDI QIDQ974749FDOQ974749
Spyros Angelopoulos, Allan Borodin
Publication date: 7 June 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.014
Recommendations
Randomized algorithms (68W20) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Discrete location and assignment (90B80)
Cites Work
- Social choice and individual values
- Title not available (Why is that?)
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Title not available (Why is that?)
- Online algorithms. The state of the art
- On the power of randomization in on-line algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for Scheduling Independent Tasks
- Greedy Strikes Back: Improved Facility Location Algorithms
- Title not available (Why is that?)
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Title not available (Why is that?)
- Crossing Number is NP-Complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- A lower bound for randomized on-line scheduling algorithms
- A lower bound for randomized on-line multiprocessor scheduling
- A better lower bound on the competitive ratio of the randomized 2-server problem
- An optimal on-line algorithm for metrical task system
- New algorithms for an ancient scheduling problem.
- Title not available (Why is that?)
- A new greedy approach for facility location problems
- The Online Median Problem
- Matroids and the greedy algorithm
- Approximating the throughput of multiple machines in real-time scheduling
- On the competitive ratio for online facility location
- Title not available (Why is that?)
- Generating Sparse 2-Spanners
- Semi-online scheduling with decreasing job sizes
- Interval selection: Applications, algorithms, and lower bounds
- Title not available (Why is that?)
- On randomized online scheduling
- (Incremental) priority algorithms
- Priority algorithms for makespan minimization in the subset model.
- The power of priority algorithms for facility location and set cover
- Toward a model for backtracking and dynamic programming
- Title not available (Why is that?)
- Approximation and Online Algorithms
- Title not available (Why is that?)
- Automata, Languages and Programming
- On the Greedy Solution of Ordering Problems
- Note on Independence Functions
- Approximation and Online Algorithms
- Hierarchies for classes of priority algorithms for job scheduling
- Title not available (Why is that?)
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
- Greedoids and Linear Objective Functions
- Priority Algorithms for the Subset-Sum Problem
Cited In (8)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
- Erratum to: ``Greedy matching: guarantees and limitations
- On extensions of the deterministic online model for bipartite matching and max-sat
- Priority algorithms for makespan minimization in the subset model.
- The power of priority algorithms for facility location and set cover
- Title not available (Why is that?)
- Greedy matching: guarantees and limitations
- On conceptually simple algorithms for variants of online bipartite matching
This page was built for publication: Randomized priority algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974749)
