scientific article; zbMATH DE number 1256669
From MaRDI portal
Publication:4230356
zbMath0977.68504MaRDI QIDQ4230356
G. Turpin, Amos Fiat, Richard M. Karp, Ran El-Yaniv
Publication date: 16 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Related Items (22)
The online knapsack problem with incremental capacity ⋮ Competitive analysis of incentive compatible on-line auctions ⋮ Serving requests with on-line routing ⋮ Competitive algorithms for the on-line traveling salesman ⋮ An improvement on El-Yaniv-Fiat-Karp-Turpin's money-making bi-directional trading strategy ⋮ Constant competitive algorithms for unbounded one-way trading under monotone hazard rate ⋮ Competitive analysis of bi-directional non-preemptive conversion ⋮ Competitive algorithms for unbounded one-way trading ⋮ Average-case competitive analyses for one-way trading ⋮ How much is it worth to know the future in online conversion problems? ⋮ Strategies for maximizing seller's profit under unknown buyer's valuations ⋮ Price Fluctuations: To Buy or to Rent ⋮ On-line resource management with applications to routing and scheduling ⋮ On-line vertex-covering ⋮ Competitive analysis of the online inventory problem ⋮ Optimal online \(k\)-min search ⋮ Competitive difference analysis of the cash management problem with uncertain demands ⋮ Empirical Analysis of an Online Algorithm for Multiple Trading Problems ⋮ Online k-max Search Algorithms with Applications to the Secretary Problem ⋮ Online search with time-varying price bounds ⋮ Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices ⋮ Delayed information and action in on-line algorithms
This page was built for publication:
