Suchergebnisse - "Approximation Algorithm"

An approximation algorithm for diversity-aware fair k-supplier problem von Chen, Xianrun, Ji, Sai, Wu, Chenchen, Xu, Yicheng, Yang, Yang

Volltext

An almost optimal approximation algorithm for monotone submodular multiple knapsack von Fairstein, Yaron, Kulik, Ariel, Naor, Joseph (Seffi), Raz, Danny, Shachnai, Hadas

“… (1−e−1−ε)-approximation algorithm for the problem, for any ε>0. The algorithm relies on a structuring technique which converts a general multiple knapsack …”
Volltext

Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint von Shi, Yishuo, Lai, Xiaoyan

“… The maximization of non-negative monotone submodular functions under a certain constraint is intensively studied. However, there are few works considering the …”
Volltext

Approximation algorithm of maximizing non-submodular functions under non-submodular constraint von Lai, Xiaoyan, Shi, Yishuo

“… Nowadays, maximizing the non-negative and non-submodular objective functions under Knapsack constraint or Cardinality constraint is deeply researched …”
Volltext

Approximation algorithm for prize-collecting weighted set cover with fairness constraints von Zhou, Mingchao, Zhang, Zhao

“… of elements required to be covered. The goal is to minimize the cost of selected sets plus the penalties on those uncovered elements, subject to the constraint that every group has its coverage requirement satisfied …”
Volltext

An outer approximation algorithm for the robust shortest path problem von Shahabi, Mehrdad, Unnikrishnan, Avinash, Boyles, Stephen D.

“… •Problem is solved using the outer approximation algorithm.•The algorithm delivers the optimal solution for four real world transportation networks …”
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

An Approximation Algorithm for Multi-Unit Auctions : Numerical and Subject Experiments von Satoshi Takahashi, Yoichi Izunaga, Naoki Watanabe

“… Takahashi and Shigeno thus proposed a greedy based approximation algorithm (GBA). In a subject experiment there was truly a difference in efficiency rate but no significant difference in seller's revenue between GBA and VCG …”
Volltext

Sequential parametric convex approximation algorithm for bilinear matrix inequality problem von Lee, Donghwan, Hu, Jianghai

“… The goal of this paper is to study algorithms for solving optimization problems subject to bilinear matrix inequalities (BMIs …”
Volltext

Approximation Algorithm for the Single Machine Scheduling Problem with Release Dates and Submodular Rejection Penalty von Liu, Xiaofei, Li, Weidong

“… In this paper, we consider the single machine scheduling problem with release dates and nonmonotone submodular rejection penalty. We are given a single machine …”
Volltext

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint von Calinescu, Gruia, Chekuri, Chandra, Pál, Martin, Vondrák, Jan

“… Let $f:2^X \rightarrow \cal R_+$ be a monotone submodular set function, and let $(X,\cal I)$ be a matroid. We consider the problem ${\rm max}_{S \in \cal I} …”
Volltext

An Approximation Algorithm for Multi-unit Auctions: Numerical and Subject Experiments von Ropuszyńska-Surma, Edyta, Węglarz, Magdalena, Szwabiński, Janusz

Volltext

An approximation algorithm for multi-agent scheduling on two uniform parallel machines von Gu, Manzhan, Lu, Xiwen, Gu, Jinwei

“… Then an approximation algorithm is proposed for the multi-agent scheduling problem, in which agents are scheduled in the non-decreasing order of the measure values, and all jobs of each agent …”
Volltext

Coordinated order scheduling and outsourcing on dedicated parallel machines von Ou, Jinwen, Li, Weidong, Zhong, Xueling

“… In the first problem, the objective is to minimize the makespan of the accepted jobs (orders) subject to the constraint that the total rejection …”
Volltext

Gaussian downlink user selection subject to access limit, power budget, and rate demands von Liu, Xiang, Zou, Jinyu, Chen, Pengpeng, Wan, Peng-Jun

“… In this paper, we show that this problem is NP-hard, and present a (1−1/e)-approximation algorithm for this problem …”
Volltext

Wireless Charger Placement for Directional Charging von Haipeng Dai, Xiaoyu Wang, Liu, Alex X., Huizhen Ma, Guihai Chen, Wanchun Dou

“… To address PLOT, we propose a 1 - 1/ε - ε approximation algorithm. First, we present techniques to approximate the nonlinear charging power and the expected charging utility to make the problem almost linear …”
Volltext

An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints von Sadfi, Cherif, Penz, Bernard, Rapine, Christophe, Błażewicz, Jacek, Formanowicz, Piotr

“… We propose an approximation algorithm to solve the problem with a worst case error bound of 3/17 …”
Volltext

A successive linear approximation algorithm for the global minimization of a concave quadratic program von Telli, Mohamed, Bentobache, Mohand, Mokhtari, Abdelkader

“… In this work, we propose an algorithm for finding an approximate global minimum of a concave quadratic function with a negative semi-definite matrix, subject to linear equality and inequality …”
Volltext

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

Volltext

Recovery of discrete spectra radiated by substance in deep vacuum using integral approximation algorithm von Aleksandrova, A.A., Sizikov, V.S.

“… To solve the system of linear-nonlinear equations, an integral approximation algorithm is developed that combines the solution of a linear integral equation and a system of linear algebraic equations …”
Volltext