Efficient algorithms for online decision problems (Q2568459): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Adam Tauman Kalai / rank
Normal rank
 
Property / author
 
Property / author: Adam Tauman Kalai / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2004.10.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2169401877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive routing with end-to-end feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting to a reliable network path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static optimality and dynamic search-optimality in lists and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory and Kernel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic huffman coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting nearly as well as the best pruning of a planar decision graph. / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/1532443041424328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank

Latest revision as of 16:21, 10 June 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for online decision problems
scientific article

    Statements

    Efficient algorithms for online decision problems (English)
    0 references
    0 references
    0 references
    10 October 2005
    0 references
    online algorithms
    0 references
    Hannan's algorithm
    0 references
    optimization
    0 references
    decision theory
    0 references

    Identifiers