Suchergebnisse - "constant-factor approximation algorithm"

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center von 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 …”
Volltext

Minimizing the Deployment Cost of UAVs for Delay-Sensitive Data Collection in IoT Networks von 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 …”
Volltext

Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity von 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 …”
Volltext

On maximizing a monotone k-submodular function subject to a matroid constraint von 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 …”
Volltext

On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering von 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 …”
Volltext

Minimizing the Number of Deployed UAVs for Delay-bounded Data Collection of IoT Devices von 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 …”
Volltext

On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation Algorithms von 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 …”
Volltext

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

“… factor approximation algorithm, when the demands of customers are independent and identically distributed Bernoulli experiments …”
Volltext

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems von 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 …”
Volltext

Approximation algorithms for clustering with dynamic points von 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 …”
Volltext

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints von 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 …”
Volltext

Approximation Algorithms for Orienteering and Discounted-Reward TSP von 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 …”
Volltext

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 von Shinsaku Sakaue

Volltext

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

“… For the general case on m >1 machines, it proposes a polynomial time constant factor approximation algorithm …”
Volltext

Optimizing Energy Efficiency Over Energy-Harvesting LTE Cellular Networks von 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 …”
Volltext

On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering von 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 …”
Volltext

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

“… We obtain a constant-factor approximation algorithm for dynamic ordered \(k\)-median under mild assumptions on the input …”
Volltext

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

“… This dissertation concerns network resource allocation algorithms. Optimized scheduling and allocation of limited resources of networks are critical for many …”
Volltext

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

“… For the general case on m>1 machines, it proposes a polynomial time constant factor approximation algorithm …”
Volltext

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity von 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 …”
Volltext