scholarly journals Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization

2019 ◽  
pp. 377-415
Author(s):  
Orit E. Raz ◽  
Avi Wigderson
Keyword(s):  
Submodular Optimization ◽  
Graph Rigidity ◽  
Subspace Arrangements

Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint

2021 ◽  
Vol 5 (1) ◽  
pp. 1-31
Author(s):  
Kai Han ◽  
Shuang Cui ◽  
Tianshuai Zhu ◽  
Enpei Zhang ◽  
Benwei Wu ◽  
...  
Keyword(s):  
Approximation Algorithms ◽  
Fundamental Problem ◽  
Randomized Algorithm ◽  
Deterministic Algorithm ◽  
Submodular Function ◽  
Approximation Ratio ◽  
Performance Bounds ◽  
Data Summarization ◽  
Submodular Optimization ◽  
Knapsack Constraint

Data summarization, i.e., selecting representative subsets of manageable size out of massive data, is often modeled as a submodular optimization problem. Although there exist extensive algorithms for submodular optimization, many of them incur large computational overheads and hence are not suitable for mining big data. In this work, we consider the fundamental problem of (non-monotone) submodular function maximization with a knapsack constraint, and propose simple yet effective and efficient algorithms for it. Specifically, we propose a deterministic algorithm with approximation ratio 6 and a randomized algorithm with approximation ratio 4, and show that both of them can be accelerated to achieve nearly linear running time at the cost of weakening the approximation ratio by an additive factor of ε. We then consider a more restrictive setting without full access to the whole dataset, and propose streaming algorithms with approximation ratios of 8+ε and 6+ε that make one pass and two passes over the data stream, respectively. As a by-product, we also propose a two-pass streaming algorithm with an approximation ratio of 2+ε when the considered submodular function is monotone. To the best of our knowledge, our algorithms achieve the best performance bounds compared to the state-of-the-art approximation algorithms with efficient implementation for the same problem. Finally, we evaluate our algorithms in two concrete submodular data summarization applications for revenue maximization in social networks and image summarization, and the empirical results show that our algorithms outperform the existing ones in terms of both effectiveness and efficiency.

Anchor Selection for SLAM Based on Graph Topology and Submodular Optimization

2021 ◽  
pp. 1-22
Author(s):  
Yongbo Chen ◽  
Liang Zhao ◽  
Yanhao Zhang ◽  
Shoudong Huang ◽  
Gamini Dissanayake
Keyword(s):  
Graph Topology ◽  
Submodular Optimization ◽  
Selection For

scholarly journals Sensor Array Design Through Submodular Optimization

2019 ◽  
Vol 65 (1) ◽  
pp. 664-675 ◽  
Author(s):  
Gal Shulkind ◽  
Stefanie Jegelka ◽  
Gregory W. Wornell
Keyword(s):  
Sensor Array ◽  
Array Design ◽  
Submodular Optimization

Subspace Arrangements

1994 ◽  
pp. 321-370 ◽  
Author(s):  
Anders Björner
Keyword(s):  
Subspace Arrangements

scholarly journals Graph Rigidity Application for Localization in WSN

2012 ◽  
Vol 49 (9) ◽  
pp. 15-21 ◽  
Author(s):  
Shamantha Rai.B ◽  
Shirshu Varma
Keyword(s):  
Graph Rigidity
Sign in / Sign up

Export Citation Format

Share Document