NDLI: The online disjoint set cover problem and its applications

Content Provider	IEEE Xplore Digital Library
Author	Pananjady, A. Bagaria, V.K. Vaze, R.
Copyright Year	2015
Description	Author affiliation: Dept. of EECS, Univ. of California, Berkeley, Berkeley, CA, USA (Pananjady, A.) \|\| Dept. of Electr. Eng., Indian Inst. of Technol. Madras, Chennai, India (Bagaria, V.K.) \|\| Sch. of Technol. & Comput. Sci., Tata Inst. of Fundamental Res., Mumbai, India (Vaze, R.)
Abstract	Given a universe U of n elements and a collection of subsets S of U, the maximum disjoint set cover problem (DSCP) is to partition S into as many set covers as possible, where a set cover is defined as a collection of subsets whose union is U. We consider the online DSCP, in which the subsets arrive one by one (possibly in an order chosen by an adversary), and must be irrevocably assigned to some partition on arrival with the objective of minimizing the competitive ratio. The competitive ratio of an online DSCP algorithm A is defined as the maximum ratio of the number of disjoint set covers obtained by the optimal offline algorithm to the number of disjoint set covers obtained by A across all inputs. We propose an online algorithm for solving the DSCP with competitive ratio ln n. We then show a lower bound of Ω(√ln n) on the competitive ratio for any online DSCP algorithm. The online disjoint set cover problem has wide ranging applications in practice, including the online crowd-sourcing problem, the online coverage lifetime maximization problem in WSNs, and in online resource allocation problems.
Starting Page	1221
Ending Page	1229
File Size	250281
Page Count	9
File Format	PDF
ISBN	9781479983810
DOI	10.1109/INFOCOM.2015.7218497
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-04-26
Publisher Place	Hong Kong
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Color Partitioning algorithms Resource management Algorithm design and analysis Silicon Conferences Computers
Content Type	Text
Resource Type	Article

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

The Online Disjoint Set Cover Problem and its Applications

Distributed Algorithm for Set K-Cover Problem and its Worst Case Analysis

Resource allocation for decode-and-forward relay-assisted SC-FDMA systems

Online Disjoint Set Cover Without Prior Knowledge

The Submodular Secretary Problem Goes Linear

The Online Disjoint Set Cover Problem and its Applications

The Online Set Cover Problem

System Yield Based Spectrum Allocation Algorithm for Cognitive Radio

An Algorithm for Approximating Set Cover and Its Application on Logic Circuit Optimization

The online disjoint set cover problem and its applications

Similar Documents

The Online Disjoint Set Cover Problem and its Applications

Distributed Algorithm for Set K-Cover Problem and its Worst Case Analysis

Resource allocation for decode-and-forward relay-assisted SC-FDMA systems

Online Disjoint Set Cover Without Prior Knowledge

The Submodular Secretary Problem Goes Linear

The Online Disjoint Set Cover Problem and its Applications

The Online Set Cover Problem

System Yield Based Spectrum Allocation Algorithm for Cognitive Radio

An Algorithm for Approximating Set Cover and Its Application on Logic Circuit Optimization

The online disjoint set cover problem and its applications