Back to Results
First PageMeta Content
Analysis of algorithms / NP-complete problems / Probabilistic complexity theory / Randomized algorithm / Set cover problem / Competitive analysis / Algorithm / Randomized rounding / Euclidean algorithm / Mathematics / Theoretical computer science / Applied mathematics


The Online Set Cover Problem (Extended Abstract) Noga Alon∗ Baruch Awerbuch†
Add to Reading List

Document Date: 2007-10-09 11:17:36

Open Document

File Size: 143,30 KB

Share Result on Facebook

City

Haifa / Baltimore / Wiley / /

Company

IBM / Fiat / /

Country

United States / Israel / /

/

Facility

Tel Aviv University / Johns Hopkins University / /

IndustryTerm

non-trivial deterministic algorithm / online fractional solution / online version / Online Set Cover Problem / online solution / deterministic online algorithm / online prediction / deterministic algorithm / online algorithm / fractional solution / online algorithms / online setting / optimum solution / trivial algorithm / learning tools / /

Organization

School of Computer Science / Hermann Minkowski Minerva Center for Geometry / C. / National Science Foundation / Israel Science Foundation / Johns Hopkins University / European Union / Beverly Sackler Faculty of Exact Sciences / X1 / Tel Aviv University / Tel Aviv / Technion / /

Person

Raymond Sackler / Eli Gafni / Joseph (Seffi) Naor Niv Buchbinder / Sanjeev Khanna / Beverly Sackler / Baruch Awerbuch† Yossi Azar / Elias Koutsoupias / Baruch Schieber / Julia Chuzhoy / /

Position

rt / network manager / last author / /

ProvinceOrState

Maryland / New York / /

PublishedMedium

Theory of Computing / /

Technology

online algorithm / randomized algorithm / On-line algorithms / Online algorithms / non-trivial deterministic algorithm / trivial algorithm / deterministic algorithm / deterministic online algorithm / machine learning / 1 online algorithm / WINNOW algorithm / /

URL

http /

SocialTag