activity
20162023
most citedLeast Cost Influence Maximization Across Multiple Social Networks

91 citations · 137 across the 22 of their papers we have counts for

collaborators
Showing cs.DSShow all

7 papers · 1 filter

cs.DS2022

Efficient Algorithms for Monotone Non-Submodular Maximization with Partition Matroid Constraint

Lan N. Nguyen, My T. Thai

In this work, we study the problem of monotone non-submodular maximization with partition matroid constraint. Although a generalization of this problem has been studied in literatu…

cs.DS2020

Minimum Robust Multi-Submodular Cover for Fairness

Lan N. Nguyen, My T. Thai

In this paper, we study a novel problem, Minimum Robust Multi-Submodular Cover for Fairness (MinRF), as follows: given a ground set ; monotone submodular functions $f_1,...,…

cs.DS2020

Length-Bounded Paths Interdiction in Continuous Domain for Network Performance Assessment

Lan N. Nguyen, My T. Thai

Studying on networked systems, in which a communication between nodes is functional if their distance under a given metric is lower than a pre-defined threshold, has received signi…

cs.DS2019

Cost-aware Targeted Viral Marketing: Approximation with Less Samples

Canh V. Pham, Hieu V. Duong, My T. Thai

Cost-aware Targeted Viral Marketing (CTVM), a generalization of Influence Maximization (IM), has received a lot of attentions recently due to its commercial values. Previous approx…

cs.DS2019

Submodular Cost Submodular Cover with an Approximate Oracle

Victoria G. Crawford, Alan Kuhnle, My T. Thai

In this work, we study the Submodular Cost Submodular Cover problem, which is to minimize the submodular cost required to ensure that the submodular benefit function exceeds a give…

cs.DS20194 cited

Network Resilience Assessment via QoS Degradation Metrics: An Algorithmic Approach

Lan N. Nguyen, My T. Thai

This paper focuses on network resilience to perturbation of edge weight. Other than connectivity, many network applications nowadays rely upon some measure of network distance betw…