Amortized efficiency of list update and paging rules
Communications of the ACM
Online matching with blocked input
Information Processing Letters
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Journal of the ACM (JACM)
A competitive analysis of the list update problem with lookahead
Theoretical Computer Science
Online computation and competitive analysis
Online computation and competitive analysis
Online bin packing with lookahead
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On-line single-server dial-a-ride problems
Theoretical Computer Science
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
The Minimum Latency Problem Is NP-Hard for Weighted Trees
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
News from the Online Traveling Repairman
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Developments from a June 1996 seminar on Online algorithms: the state of the art
On-Line Dial-a-Ride Problems under a Restricted Information Model
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
The Online Dial-a-Ride Problem under Reasonable Load
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
The Online TSP Against Fair Adversaries
INFORMS Journal on Computing
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Journal of the ACM (JACM)
Algorithms for the on-line quota traveling salesman problem
Information Processing Letters
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios
Transportation Science
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
On the power of lookahead in on-line vehicle routing problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
LP-based online scheduling: from single to parallel machines
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
The on-line asymmetric traveling salesman problem
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Totally clairvoyant scheduling with relative timing constraints
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Scheduling on identical machines: How good is LPT in an on-line setting?
Operations Research Letters
On the power of lookahead in on-line server routing problems
Theoretical Computer Science
Hi-index | 0.00 |
In several practical circumstances we have to solve a problem whose instance is not a priori completely known. Situations of this kind occur in computer systems and networks management, in financial decision making, in robotics etc. Problems that have to be solved without a complete knowledge of the instance are called on−lineproblems. The analysis of properties of on-line problems and the design of algorithmic techniques for their solution (on−linealgorithms) have been the subject of intense study since the 70-ies, when classical algorithms for scheduling tasks in an on-line fashion [22] and for handling paging in virtual storage systems [11] have been first devised. In the 80-ies formal concepts for analyzing and measuring the quality of on-line algorithms have been introduced [40] and the notion of competitiveanalysis has been defined as the ratio between the value of the solution that is obtained by an on-line algorithm and the value of the best solution that can be achieved by an optimum off-line algorithm that has full knowledge of the problem instance. Since then a very broad variety of on-line problems have been addressed in the literature [14, 19]: memory allocation and paging, bin packing, load balancing in multiprocessor systems, updating and searching a data structure (e.g. a list), scheduling, financial investment, etc.