Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint

Chien Chung Huang, Naonori Kakimura, Yuichi Yoshida

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in the streaming setting. In particular, the elements arrive sequentially and at any point of time, the algorithm has access only to a small fraction of the data stored in primary memory. For this problem, we propose a (0.363-ϵ)-approximation algorithm, requiring only a single pass through the data; moreover, we propose a (0.4 - ϵ)-approximation algorithm requiring a constant number of passes through the data. The required memory space of both algorithms depends only on the size of the knapsack capacity and ϵ.

Original languageEnglish
Title of host publicationApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Volume81
ISBN (Electronic)9783959770446
DOIs
Publication statusPublished - 2017 Aug 1
Event20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2017 and the 21st International Workshop on Randomization and Computation, RANDOM 2017 - Berkeley, United States
Duration: 2017 Aug 162017 Aug 18

Other

Other20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2017 and the 21st International Workshop on Randomization and Computation, RANDOM 2017
CountryUnited States
CityBerkeley
Period17/8/1617/8/18

Fingerprint

Approximation algorithms
Data storage equipment

Keywords

  • Constant approximation
  • Multiple-pass streaming
  • Single-pass streaming
  • Submodular functions

ASJC Scopus subject areas

  • Software

Cite this

Huang, C. C., Kakimura, N., & Yoshida, Y. (2017). Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017 (Vol. 81). [11] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2017.11

Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. / Huang, Chien Chung; Kakimura, Naonori; Yoshida, Yuichi.

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017. Vol. 81 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. 11.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Huang, CC, Kakimura, N & Yoshida, Y 2017, Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017. vol. 81, 11, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2017 and the 21st International Workshop on Randomization and Computation, RANDOM 2017, Berkeley, United States, 17/8/16. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2017.11
Huang CC, Kakimura N, Yoshida Y. Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017. Vol. 81. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017. 11 https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2017.11
Huang, Chien Chung ; Kakimura, Naonori ; Yoshida, Yuichi. / Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017. Vol. 81 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017.
@inproceedings{36c307483a5445bf9b6b3e8030601edc,
title = "Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint",
abstract = "In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in the streaming setting. In particular, the elements arrive sequentially and at any point of time, the algorithm has access only to a small fraction of the data stored in primary memory. For this problem, we propose a (0.363-ϵ)-approximation algorithm, requiring only a single pass through the data; moreover, we propose a (0.4 - ϵ)-approximation algorithm requiring a constant number of passes through the data. The required memory space of both algorithms depends only on the size of the knapsack capacity and ϵ.",
keywords = "Constant approximation, Multiple-pass streaming, Single-pass streaming, Submodular functions",
author = "Huang, {Chien Chung} and Naonori Kakimura and Yuichi Yoshida",
year = "2017",
month = "8",
day = "1",
doi = "10.4230/LIPIcs.APPROX/RANDOM.2017.11",
language = "English",
volume = "81",
booktitle = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

}

TY - GEN

T1 - Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint

AU - Huang, Chien Chung

AU - Kakimura, Naonori

AU - Yoshida, Yuichi

PY - 2017/8/1

Y1 - 2017/8/1

N2 - In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in the streaming setting. In particular, the elements arrive sequentially and at any point of time, the algorithm has access only to a small fraction of the data stored in primary memory. For this problem, we propose a (0.363-ϵ)-approximation algorithm, requiring only a single pass through the data; moreover, we propose a (0.4 - ϵ)-approximation algorithm requiring a constant number of passes through the data. The required memory space of both algorithms depends only on the size of the knapsack capacity and ϵ.

AB - In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in the streaming setting. In particular, the elements arrive sequentially and at any point of time, the algorithm has access only to a small fraction of the data stored in primary memory. For this problem, we propose a (0.363-ϵ)-approximation algorithm, requiring only a single pass through the data; moreover, we propose a (0.4 - ϵ)-approximation algorithm requiring a constant number of passes through the data. The required memory space of both algorithms depends only on the size of the knapsack capacity and ϵ.

KW - Constant approximation

KW - Multiple-pass streaming

KW - Single-pass streaming

KW - Submodular functions

UR - http://www.scopus.com/inward/record.url?scp=85028696138&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028696138&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.APPROX/RANDOM.2017.11

DO - 10.4230/LIPIcs.APPROX/RANDOM.2017.11

M3 - Conference contribution

AN - SCOPUS:85028696138

VL - 81

BT - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -