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

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

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

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

On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering Autor Ye, Lintao, Woodford, Nathaniel, Roy, Sandip, Sundaram, Shreyas

“… We show the fundamental result that there is no polynomial-time constant-factor approximation algorithm for this problem…”
Získat plný text

Minimizing the Number of Deployed UAVs for Delay-bounded Data Collection of IoT Devices Autor Zhang, Junqi, Li, Zheng, Xu, Wenzheng, Peng, Jian, Liang, Weifa, Xu, Zichuan, Ren, Xiaojiang, Jia, Xiaohua

“… collection tours, subject to the constraint that the total time spent in each tour is no greater than B…”
Získat plný text

On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation Algorithms Autor Pasqualetti, F., Franchi, A., Bullo, F.

“…The subject of this paper is the patrolling of an environment with the aid of a team of autonomous agents…”
Získat plný text

A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands Autor Fernstrøm, Finn, Steiner, Teresa Anna

“… factor approximation algorithm, when the demands of customers are independent and identically distributed Bernoulli experiments…”
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

Approximation algorithms for clustering with dynamic points Autor Deng, Shichuan, Li, Jian, Rabani, Yuval

“… of points and the movement cost of centers, or to minimize one subject to some constraints on the other. We obtain a constant-factor approximation algorithm for dynamic ordered k-median under mild assumptions on the input…”
Získat plný text

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints Autor Lee, Jon, Mirrokni, Vahab S., Nagarajan, Viswanath, Sviridenko, Maxim

“… Unlike submodular minimization, submodular maximization is NP-hard. In this paper, we give the first constant-factor approximation algorithm for maximizing any nonnegative submodular function subject to multiple matroid or knapsack constraints…”
Získat plný text

Approximation Algorithms for Orienteering and Discounted-Reward TSP Autor Blum, Avrim, Chawla, Shuchi, Karger, David R., Lane, Terran, Meyerson, Adam, Minkoff, Maria

“…In this paper, we give the first constant-factor approximation algorithm for the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward traveling salesman problem (TSP…”
Získat plný text

On maximizing a monotone <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll">k</mml:math>-submodular function subject to a matroid constraint Autor Shinsaku Sakaue

Získat plný text

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines Autor Dereniowski, Dariusz, Kubiak, Wiesław

“… For the general case on m >1 machines, it proposes a polynomial time constant factor approximation algorithm…”
Získat plný text

Optimizing Energy Efficiency Over Energy-Harvesting LTE Cellular Networks Autor Mahdavi-Doost, Hajar, Prasad, Narayan, Rangarajan, Sampath

“… We show that the latter sub-problem can be reformulated as a constrained submodular set function maximization problem which enables us to design a constant-factor approximation algorithm…”
Získat plný text

On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering Autor Ye, Lintao, Woodford, Nathaniel, Roy, Sandip, Sundaram, Shreyas

“… We show the fundamental result that there is no polynomial-time constant-factor approximation algorithm for this problem…”
Získat plný text

Approximation Algorithms for Clustering with Dynamic Points Autor Deng, Shichuan, Li, Jian, Rabani, Yuval

“… We obtain a constant-factor approximation algorithm for dynamic ordered \(k\)-median under mild assumptions on the input…”
Získat plný text

Algorithms for Network Resource Allocation Under Adversarial Dynamics and Assignment Constraints Autor Liaee, Mehraneh

“…This dissertation concerns network resource allocation algorithms. Optimized scheduling and allocation of limited resources of networks are critical for many…”
Získat plný text

Makespan minimization of multi-slot just-in-time scheduling onsingle and parallel machines Autor Dereniowski, Dariusz, Kubiak, Wiesaw

“… For the general case on m>1 machines, it proposes a polynomial time constant factor approximation algorithm…”
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, Alberto Marchetti Spaccamela, 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