NDLI: The online set cover problem

Please wait, while we are loading the content...

Hidden translation and orbit coset in quantum computing

Better streaming algorithms for clustering problems

Exponential algorithmic speedup by a quantum walk

Management of multi-queue switches in QoS networks

Exponential lower bound for 2-query locally decodable codes via a quantum argument

Short path queries in planar graphs in constant time

The computational complexity of some julia sets

Boosting in the presence of noise

Generating random regular graphs

Server scheduling in the $L_{p}$ norm: a rising tide lifts all boat

Randomly coloring graphs of girth at least five

On the fractal behavior of TCP

New degree bounds for polynomial threshold functions

Simpler and better approximation algorithms for network design

The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice

The intrinsic dimensionality of graphs

Touring a sequence of polygons

Reducing truth-telling online mechanisms to online optimization

Sublinear geometric algorithms

OPT versus LOAD in dynamic storage allocation

Polylogarithmic inapproximability

Uniform hashing in constant time and linear space

Lower bounds on the amount of randomness in private computation

Approximate counting by dynamic programming

Classical deterministic complexity of Edmonds' Problem and quantum entanglement

Approximation algorithms for hierarchical location problems

Quantum time-space tradeoffs for sorting

Constant factor approximation of vertex-cuts in planar graphs

Optimal probabilistic fingerprint codes

Integer priority queues with decrease key in constant time and the single source shortest paths problem

Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions

Learning juntas

The threshold for random k-SAT is $2^{k}$ (ln 2 - O(k))

Work-competitive scheduling for cooperative computing with dynamic groups

Evolving sets and mixing

On the limits of cache-obliviousness

Sampling lower bounds via information theory

Meet and merge: approximation algorithms for confluent flows

New lattice based cryptographic constructions

A tight bound on approximating arbitrary metrics by tree metrics

Well-separated pair decomposition for the unit-disk graph metric and its applications

Near-optimal network design with selfish agents

Distinct distances in three and higher dimensions

Consistent load balancing via spread minimization

A new multilayered PCP and the hardness of hypergraph vertex cover

Almost random graphs with simple hash functions

Cell-probe lower bounds for the partial match problem

Testing subgraphs in directed graphs

Adiabatic quantum state generation and statistical zero knowledge

Approximation schemes for clustering problems

On the power of quantum fingerprinting

The online set cover problem

Linear time encodable and list decodable codes

A new approach to dynamic all pairs shortest paths

Random knapsack in expected polynomial time

A tight time lower bound for space-optimal implementations of multi-writer snapshots

Modified log-sobolev inequalities, mixing and hypercontractivity

A sublinear algorithm for weakly approximating edit distance

Some 3CNF properties are hard to test

Optimal oblivious routing in polynomial time

Lower bounds on the efficiency of encryption and digital signature schemes

On average distortion of embedding metrics into the line and into $L_{1}$

Alpha-shapes and flow shapes are homotopy equivalent

Pricing network edges for heterogeneous selfish users

Cutting triangular cycles of lines in space

A stochastic process on the hypercube with applications to peer-to-peer networks

Extractors: optimal up to constant factors

Dynamic rectangular intersection with priorities

Two applications of information complexity

On the sample size of k-restricted min-wise independent permutations and other k-wise distributions

Reconstructing curves in three (and higher) dimensional space from noisy data

A fast algorithm for computing steiner edge connectivity

Derandomizing polynomial identity tests means proving circuit lower bounds

Primal-dual meets local search: approximating MST's with nonuniform degree bounds

Non-interactive and reusable non-malleable commitment schemes

On metric ramsey-type phenomena

Randomness-efficient low degree tests and short PCPs via epsilon-biased sets

Space efficient dynamic stabbing with fast queries

Bounded-concurrent secure two-party computation without setup assumptions

A proof of alon's second eigenvalue conjecture

The online set cover problem

Content Provider	ACM Digital Library
Author	Alon, Noga Azar, Yossi Awerbuch, Baruch
Abstract	Let X=[1,2,•••,n] be a ground set of n elements, and let S be a family of subsets of X, \|S\|=m, with a positive cost $c_{S}$ associated with each S ∈ S.Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives elements to the algorithm from X one-by-one. Once a new element is given, the algorithm has to cover it by some set of S containing it. We assume that the elements of X and the members of S are known in advance to the algorithm, however, the set X' ⊆ X of elements given by the adversary is not known in advance to the algorithm. (In general, X' may be a strict subset of X.) The objective is to minimize the total cost of the sets chosen by the algorithm. Let C denote the family of sets in S that the algorithm chooses. At the end of the game the adversary also produces (off-line) a family of sets $C_{OPT}$ that covers X'. The performance of the algorithm is the ratio between the cost of C and the cost of $C_{OPT}.$ The maximum ratio, taken over all input sequences, is the competitive ratio of the algorithm.We present an O(log m log n) competitive deterministic algorithm for the problem, and establish a nearly matching Ω(log n log m/log log m + log log n) lower bound for all interesting values of m and n. The techniques used are motivated by similar techniques developed in computational learning theory for online prediction (e.g., the WINNOW algorithm) together with a novel way of converting the fractional solution they supply into a deterministic online algorithm.
Starting Page	100
Ending Page	105
Page Count	6
File Format	PDF
ISBN	1581136749
DOI	10.1145/780542.780558
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-06-09
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Randomized rounding Competitive analysis Set-cover Derandomization On-line algorithms
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in