Sequence submodular maximization meets streaming

Ruiqi Yang (), Dachuan Xu (), Longkun Guo () and Dongmei Zhang ()
Additional contact information
Ruiqi Yang: Beijing University of Technology
Dachuan Xu: Beijing University of Technology
Longkun Guo: Qilu University of Technology (Shandong Academy of Sciences)
Dongmei Zhang: Shandong Jianzhu University

Journal of Combinatorial Optimization, 2021, vol. 41, issue 1, No 4, 43-55

Abstract: Abstract In this paper, we study the problem of maximizing a sequence submodular function in the streaming setting, where the utility function is defined on sequences instead of sets of elements. We encode the sequence submodular maximization with a weighted digraph, in which the weight of a vertex reveals the utility value in selecting a single element and the weight of an edge reveals the additional profit with respect to a certain selection sequence. The edges are visited in a streaming fashion and the aim is to sieve a sequence of at most k elements from the stream, such that the utility is maximized. In this work, we present an edge-based threshold procedure, which makes one pass over the stream, attains an approximation ratio of $$(1/(2\varDelta +1)- O(\epsilon ))$$ ( 1 / ( 2 Δ + 1 ) - O ( ϵ ) ) , consumes $$O(k\varDelta /\epsilon )$$ O ( k Δ / ϵ ) memory source in total and $$O(\log (k\varDelta )/\epsilon )$$ O ( log ( k Δ ) / ϵ ) update time per edge, where $$\varDelta $$ Δ is the minimum of the maximal outdegree and indegree of the directed graph.

Keywords: Submodular maximization; Sequence; Streaming algorithm; Threshold (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00662-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:41:y:2021:i:1:d:10.1007_s10878-020-00662-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00662-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().