Search Results - "Greedy approximation algorithm"

Approximation Algorithms for k-Submodular Maximization Subject to a Knapsack Constraint by Xiao, Hao, Liu, Qian, Zhou, Yang, Li, Min

Get full text

Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks by Bollapragada, Ramesh, Li, Yanjun, Rao, Uday S

“… Under stochastic demand modeled using scenarios, we maximize the expected demand coverage subject to a budget constraint on hub installation, and technological constraints on demand coverage by installed hubs…”
Get full text

Rapid Deployment of Mobile Robots Under Temporal, Performance, Perception, and Resource Constraints by Rincon, Jose Luis Susa, Tokekar, Pratap, Kumar, Vijay, Carpin, Stefano

“… In addition, robots use imprecise sensors, and are subject to noisy dynamics. Furthermore, there are more targets than robots, so load sharing between robots is necessary…”
Get full text

Structural Identifiability in Low-Rank Matrix Factorization by Fritzilas, Epameinondas, Milanič, Martin, Rahmann, Sven, Rios-Solis, Yasmin A.

“… (subject to a mild non-degeneracy condition…”
Get full text

Approximation algorithms for \(k\)-submodular maximization subject to a knapsack constraint by Xiao, Hao, Liu, Qian, Zhou, Yang, Li, Min

“… For monotone objective functions, we present a \(\frac{1}{2}(1-e^{-2})\approx 0.432\) greedy approximation algorithm…”
Get full text

Joint sensor selection and routing for distributed estimation in wireless sensor networks by Portu-Repolles, Eduardo, Beferull-Lozano, Baltasar

“… We formulate the problem as a joint optimization of sensor selection and routing structure where we minimize the estimation distortion subject to a total communication power constraint for the WSN…”
Get full text

A budgeted maximum multiple coverage model for cybersecurity planning and management by Zheng, Kaiyue, Albert, Laura A., Luedtke, James R., Towle, Eli

“… Budgeted Maximum Multiple Coverage (BMMC) problems are formulated, and we demonstrate that the problems are submodular maximization problems subject to a knapsack constraint…”
Get full text

Online Combinatorial Optimization for Digital Marketplaces by Susan, Fransisca

“…Digital marketplaces have access to a large amount of user data, which presents new opportunities for learning and data-driven decision-making. However, there…”
Get full text

Approximation Algorithms for Drone Delivery Packing Problem by Saswata Jana, Mandal, Partha Sarathi

“… The objective of the DDP is to find an assignment for all deliveries to the drones by using the minimum number of drones subject to the battery budget and compatibility of the assignment…”
Get full text