In this paper, we consider both nonadaptive and adaptive policies for Stochastic Orienteering. We present a constant-factor approximation algorithm for the nonadaptive version and an O(log log ...

We present the first approximation algorithms for the Discrete Time-Cost Tradeoff Problem. Specifically, given a fixed budget we consider the problem of finding a shortest schedule for a project. We ...

Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to propose new ...

subspace-approximation/ ├── src/ │ ├── algorithms/ # Core algorithmic implementations │ │ ├── good_subspace.cpp # Primary algorithm (Theorems 1.1, 1.2) │ │ ├── spanning_set_finder.cpp # Theorem 1.3 ...

Network Function Virtualization (NFV) has the potential for cost-efficiency, manage-convenience, and flexibility services but meanwhile poses challenges for the service function chain (SFC) deployment ...

Approximation and Online Algorithms. (2021). An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity. Retrieved from http ...

COMP_SCI 437: Approximation Algorithms VIEW ALL COURSE TIMES AND SESSIONS Prerequisites COMP_SCI 212 and COMP_SCI 336 (or similar courses) or CS MS or CS PhDs Description. This course studies ...