L
Laks V. S. Lakshmanan
Researcher at University of British Columbia
Publications - 32
Citations - 1391
Laks V. S. Lakshmanan is an academic researcher from University of British Columbia. The author has contributed to research in topics: Maximization & Approximation algorithm. The author has an hindex of 18, co-authored 32 publications receiving 1210 citations.
Papers
More filters
Journal ArticleDOI
Approximate closest community search in networks
TL;DR: This paper develops a greedy algorithmic framework, which first finds a CTC containing Q, and then iteratively removes the furthest nodes from Q, from the graph, and proves this problem of finding a closest truss community (CTC) is NP-hard.
Journal ArticleDOI
From competition to complementarity: comparative influence diffusion and maximization
TL;DR: In this paper, the authors proposed the Comparative Independent Cascade (Com-IC) model that covers the full spectrum of entity interactions from competition to complementarity, enabling the model to capture not only competition but also complementarity to any possible degree.
Proceedings ArticleDOI
Breaking out of the box of recommendations: from items to packages
TL;DR: Because the problem of generating the top recommendation (package) is NP-complete, several approximation algorithms for generating top-k packages as recommendations are devised and analyzed.
Posted Content
From Competition to Complementarity: Comparative Influence Diffusion and Maximization
TL;DR: This work proposes the Comparative Independent Cascade (Com-IC) model, a model that covers the full spectrum of entity interactions from competition to complementarity, and designs efficient and effective approximation algorithms via non-trivial techniques based on reverse-reachable sets and a novel "sandwich approximation" strategy.
Proceedings ArticleDOI
Profit Maximization over Social Networks
Wei Lu,Laks V. S. Lakshmanan +1 more
TL;DR: This work extends the classical Linear Threshold model to incorporate prices and valuations, and factor them into users' decision-making process of adopting a product, and shows that of the three algorithms, PAGE, which assigns prices dynamically based on the profit potential of each candidate seed, has the best performance both in the expected profit achieved and in running time.