Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Link opens in a new tab
Search content at Tel Aviv University
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
The design of competitive online algorithms via a primal-dual approach
Niv Buchbinder
*
, Joseph Naor
*
Corresponding author for this work
Technion-Israel Institute of Technology
Research output
:
Book/Report
›
Book
›
peer-review
292
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The design of competitive online algorithms via a primal-dual approach'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Competitive Online Algorithm
100%
Primal-dual Algorithm
100%
Online Algorithms
50%
Online Problem
50%
Approximation Algorithms
33%
Caching
33%
Design Methodology
16%
Load Balancing
16%
Algorithmic Approach
16%
Competitive Ratio
16%
Exact Algorithm
16%
Fractional Solutions
16%
NP-hard Problem
16%
Ski Rental Problem
16%
Ad Auctions
16%
Network Flow
16%
Routing Load
16%
Linear Programming Formulation
16%
Set Cover Problem
16%
Graph Optimization Problems
16%
Computer Science
on-line algorithm
100%
Primal-Dual
100%
Approximation Algorithms
33%
Optimization Problem
16%
Load Balancing
16%
Exact Algorithm
16%
Competitive Ratio
16%
Fundamental Problem
16%
Potential Function
16%
Linear Programming
16%
Mathematics
Wide Variety
100%
Competitive Ratio
50%
NP-hard Problem
50%
Potential Function
50%
Linear Programming
50%