Výsledky vyhledávání - "Constant-factor approximation algorithms"

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center Autor Kim, Kangsan, Shin, Yongho, An, Hyung-Chan

“… In this paper, we present the first constant-factor approximation algorithm for the facility location problem with parity constraints…”
Získat plný text

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems Autor Kim, Kangsan, Shin, Yongho, Hyung-Chan, An

“… In this paper, we present the first constant-factor approximation algorithm for the facility location problem with parity constraints…”
Získat plný text

New bounds for single-machine time-dependent scheduling with uniform deterioration Autor Gkikas, Angelos, Letsios, Dimitrios, Radzik, Tomasz, Steinhöfel, Kathleen

“…(1+1/β2) approximation algorithm for the total completion time problem. Further, we propose greedy constant-factor approximation algorithms for instances with β=O(1/n) and β=Ω(n), where n is the number of jobs. Our analysis is based on an approach for comparing computed and optimal schedules via bounding pseudomatchings…”
Získat plný text

Constant approximation for fault-tolerant median problems via iterative rounding Autor Deng, Shichuan

“…•Devise constant-factor approximation algorithms using a unified LP rounding method.•The rounding algorithm simplifies the auxiliary LP by iteratively removing specific constraints…”
Získat plný text

Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes Autor Chekuri, Chandra, Vondrák, Jan, Zenklusen, Rico

“…We consider the problem of maximizing a nonnegative submodular set function $f:2 perpendicular \rightarrow {\mathbb R}_+$ over a ground set $N$ subject to a variety of packing-type constraints including…”
Získat plný text

On clustering with discounts Autor Deng, Shichuan

“…]). We also devise bi-criteria constant-factor approximation algorithms for the matroid and knapsack versions of median clustering with discounts…”
Získat plný text

Group fairness in non-monotone submodular maximization Autor Yuan, Jing, Tang, Shaojie

“… over- or under- representation of particular groups. Motivated by that, we propose and study the classic non-monotone submodular maximization problem subject to novel group fairness constraints…”
Získat plný text

Sensor planning for a symbiotic UAV and UGV system for precision agriculture Autor Tokekar, Pratap, Vander Hook, Joshua, Mulla, David, Isler, Volkan

“…We study the problem of coordinating an Unmanned Aerial Vehicle (UAV) and an Unmanned Ground Vehicle (UGV) for a precision agriculture application. In this…”
Získat plný text

Distributed Multirobot Coverage Control of Nonconvex Environments With Guarantees Autor Yengejeh, Armin Sadeghi, Asghar, Ahmad Bilal, Smith, Stephen L.

“…In this article, we revisit the problem of distributed coverage with a fleet of robots in convex and nonconvex environments. In the majority of approaches for…”
Získat plný text

Min–max tree covers of graphs Autor Even, G., Garg, N., Könemann, J., Ravi, R., Sinha, A.

Získat plný text

Stochastic Machine Scheduling with Precedence Constraints Autor Skutella, Martin, Uetz, Marc

“… [SIAM J. Comput., 31 (2001), pp. 146--166], we derive the first constant-factor approximation algorithms for this model…”
Získat plný text

Time-Constrained Scheduling of Weighted Packets on Trees and Meshes Autor ADLER, Micah, KHANNA, Sanjeev, RAJARAMAN, Rajmohan, ROSEN, Adi

Získat plný text

Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint Autor Pham, Canh V, Tran, Tan D, Ha, Dung T K, Thai, My T

“…This work, for the first time, introduces two constant factor approximation algorithms with linear query complexity for non-monotone submodular maximization over a ground set of size \(n…”
Získat plný text

Group Fairness in Non-monotone Submodular Maximization Autor Yuan, Jing, Tang, Shaojie

“… Motivated by that, we propose and study the classic non-monotone submodular maximization problem subject to novel group fairness constraints…”
Získat plný text

Optimizing energy efficiency over energy-harvesting LTE cellular networks Autor Mahdavi-Doost, Hajar, Prasad, Narayan, Rangarajan, Sampath

“… This enables us to design constant-factor approximation algorithms for maximizing the weighted sum rate as well as the two energy efficiency metrics over an energy harvesting LTE downlink…”
Získat plný text

Decision making under uncertainty Autor Li, Jian

“…Almost all important decision problems are inevitably subject to some level of uncertainty either about data measurements, the parameters, or predictions describing future evolution…”
Získat plný text

Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity Autor Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Marchetti-Spaccamela, Alberto, Reiffenhäuser, Rebecca

“… In this work, we obtain the first constant factor approximation algorithm for non-monotone submodular maximization subject to a knapsack constraint with near-optimal O(log n…”
Získat plný text

On maximizing a monotone k-submodular function subject to a matroid constraint Autor Sakaue, Shinsaku

“… For unconstrained nonnegative k-submodular maximization, Ward and Živný proposed a constant-factor approximation algorithm, which was improved by the recent work of Iwata…”
Získat plný text

Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes Autor Chekuri, Chandra, Vondrák, Jan, Zenklusen, Rico

“…We consider the problem of maximizing a non-negative submodular set function \(f:2^N \rightarrow \mathbb{R}_+\) over a ground set \(N\) subject to a variety of packing type constraints including…”
Získat plný text

Minimizing the Deployment Cost of UAVs for Delay-Sensitive Data Collection in IoT Networks Autor Xu, Wenzheng, Xiao, Tao, Zhang, Junqi, Liang, Weifa, Xu, Zichuan, Liu, Xuxun, Jia, Xiaohua, Das, Sajal K.

“… of deploying the minimum number of UAVs and finding their data collection tours, subject to the constraint that the total time spent in each tour of any UAV is no greater than <inline-formula> <tex-math notation="LaTeX">B </tex-math></inline-formula…”
Získat plný text