Suchergebnisse - "Approximation algorithms"

Parallel-batch scheduling with rejection: Structural properties and approximation algorithms von Ou, Jinwen, Lu, Lingfa, Zhong, Xueling

“… )-approximation algorithm with a complexity of O(nlogn).•An efficient PTAS with a complexity of O …”
Volltext

Improved approximation algorithms for k -submodular maximization under a knapsack constraint von Ha, Dung T.K., Pham, Canh V., Tran, Tan D.

Volltext

Approximation Algorithms for Open Shop Variations Subject to Energy Consumption von Zakharova, Yu. V.

“… As a result, NP-hardness is proved in the general case, and polynomial-time exact and approximation algorithms are proposed for the practically important special cases when preemptions are allowed …”
Volltext

Approximation Algorithms for Charging Reward Maximization in Rechargeable Sensor Networks via a Mobile Charger von Weifa Liang, Zichuan Xu, Wenzheng Xu, Jiugen Shi, Guoqiang Mao, Das, Sajal K.

“… , so that the sum of charging rewards collected from all charged sensors by the mobile charger per tour is maximized, subject …”
Volltext

Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time von Jiang, Xiaojuan, Lee, Kangbok, Pinedo, Michael L.

“… : the makespan and the total completion time.•Developing approximation algorithms relative to each objective’s optimal value …”
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

Multicell Coordinated Beamforming With Rate Outage Constraint-Part II: Efficient Approximation Algorithms von Li, Wei-Chiang, Chang, Tsung-Hui, Chi, Chong-Yung

“… The problem under consideration is a probabilistically constrained optimization problem which maximizes a predefined system utility subject to constraints on rate outage probability and power budget of each transmitter …”
Volltext

Approximation Algorithms for the Generalized Team Orienteering Problem and its Applications von Xu, Wenzheng, Liang, Weifa, Xu, Zichuan, Peng, Jian, Peng, Dezhong, Liu, Tang, Jia, Xiaohua, Das, Sajal K.

“… such that the profit sum of serving the nodes in the paths is maximized, subject to the cost budget of each vehicle …”
Volltext

Approximation Algorithms for Capacitated Perishable Inventory Systems with Positive Lead Times von Chao, Xiuli, Gong, Xiting, Shi, Cong, Yang, Chaolin, Zhang, Huanan, Zhou, Sean X.

“… In this paper, we develop an easy-to-compute approximation algorithm for this class of problems and prove that it admits a theoretical worst-case performance guarantee under independent and many …”
Volltext

Approximation algorithms for the generalized incremental knapsack problem von Faenza, Yuri, Segev, Danny, Zhang, Lingyi

“… The goal is to decide if and when to insert each item, subject to the time-dependent capacity constraints, with the objective of maximizing our total profit …”
Volltext

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

Volltext

Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing von Li, Weidong, Ou, Jinwen

Volltext

Approximation Algorithms for the Team Orienteering Problem von Xu, Wenzheng, Xu, Zichuan, Peng, Jian, Liang, Weifa, Liu, Tang, Jia, Xiaohua, Das, Sajal K.

“… In this paper we study a team orienteering problem, which is to find service paths for multiple vehicles in a network such that the profit sum of serving the nodes in the paths is maximized, subject …”
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

Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing von Guoliang Xue, Weiyi Zhang, Jian Tang, Thulasiraman, K.

“… = 2, the problem has been well studied, with several provably good polynomial time-approximation algorithms reported in the literature, which enforce one constraint while approximating …”
Volltext

Approximation algorithms for drone delivery scheduling with a fixed number of drones von Jana, Saswata, Mandal, Partha Sarathi

“… ) for the single drone delivery scheduling problem (SDSP). Also, we propose two approximation algorithms of factor 13 for the MDSP …”
Volltext

Approximation algorithms for bi-objective parallel-machine scheduling in green manufacturing von Jiang, Yiwei, Tang, Xuelian, Li, Kai, Cheng, T.C.E., Ji, Min

“… Each machine has a different constant processing cost per unit time. For the objective of minimizing the makespan, given a total cost budget, we provide an approximation algorithm with a worst-case ratio of 33+14 …”
Volltext

Randomized approximation algorithms for monotone k-submodular function maximization with constraints von Li, Yuying, Li, Min, Zhou, Yang, Niu, Shuxian, Liu, Qian

“… In recent years, k -submodular functions have garnered significant attention due to their natural extension of submodular functions and their practical …”
Volltext

LP-based approximation algorithms for capacitated facility location von Levi, Retsef, Shmoys, David B., Swamy, Chaitanya

“… In the capacitated facility location problem with hard capacities, we are given a set of facilities, , and a set of clients in a common metric space. Each …”
Volltext

Approximation algorithms for stochastic online matching with reusable resources von Shanks, Meghan, Yu, Ge, Jacobson, Sheldon H.

“… We provide constant approximation algorithms for different variations of this problem with equal-length jobs …”
Volltext