Theoretical Computer Science
Information and Computation
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Resource scheduling for parallel database and scientific applications
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximation techniques for average completion time scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On-line load balancing for related machines
Journal of Algorithms
Optimal On-Line Algorithms for Single-Machine Scheduling
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Minimum Latency Problem Is NP-Hard for Weighted Trees
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Scheduling Algorithms for Minsum Criteria
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
SIAM Journal on Computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Paths, Trees, and Minimum Latency Tours
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
Mathematics of Operations Research
Performance guarantees for hierarchical clustering
Journal of Computer and System Sciences - Special issue on COLT 2002
A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Online searching with turn cost
Theoretical Computer Science - Approximation and online algorithms
Preemptive online scheduling: optimal algorithms for all speeds
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On hierarchical diameter-clustering, and the supplier problem
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Oblivious medians via online bidding
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Randomized algorithms for online bounded bidding
Information Processing Letters
On the optimality of spiral search
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Online and incremental algorithms for facility location
ACM SIGACT News
Universal sequencing on a single machine
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
The power of recourse for online MST and TSP
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We discuss what we refer to, tentatively, as the "doubling" method for designing online and offline approximation algorithms. The rough idea is to use geometrically increasing estimates on the optimal solution to produce fragments of the algorithm's solution. The term "doubling" is a little misleading, for often factors other than 2 are used, and suggestions for a better name will be appreciated.