Suchergebnisse - approximation algorithm

A fast (2+27)-approximation algorithm for capacitated cycle covering von Traub, Vera, Tröbst, Thorben

“… We show that a greedy algorithm followed by a post-processing step yields a ( 2 + 2 7 ) -approximation for this problem by comparing the solution to a polymatroid relaxation …”
Volltext

Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs von Chakraborty, Dibyayan, Vaxès, Yann

“… Our main contribution in this paper is to provide an additive O(δ)-approximation algorithm for k-Geodesic Center on δ-hyperbolic graphs …”
Volltext

An improved approximation algorithm for Hypergraph Max p-Section von Li, Guangfeng, Sun, Jian, Gao, Jiaquan, Sun, Zhiren, Zhang, Xiaoyan

“… In this paper, we address the design of an approximation algorithm for the well-known Hypergraph Max p-Section problem …”
Volltext

An approximation algorithm for the k-prize-collecting hitting set problem: An Approximation Algorithm von Liu, Qin, Hou, Bo, Zhang, Gengsheng, Liu, Wen

“… We study the k -prize-collecting hitting set problem in hypergraphs. We first design a greedy algorithm for the k -hitting set problem with approximation ratio min { k , Δ } , where Δ …”
Volltext

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

A -approximation algorithm for scheduling on two parallel machines with job delivery coordination von Chen, Yong, Zhang, An, Tan, Zhiyi, Xue, Ying, Chen, Guangting

“… Integration of production and distribution operations at the scheduling level is one of the most important issues concerned in recent years in supply chain …”
Volltext

An Approximation Algorithm for the h -Hop Independently Submodular Maximization Problem and Its Applications von Xu, Wenzheng, Xie, Hongbin, Wang, Chenxi, Liang, Weifa, Jia, Xiaohua, Xu, Zichuan, Zhou, Pan, Wu, Weigang, Chen, Xiang

“… This study is motivated by the maximum connected coverage problem (MCCP), which is to deploy a connected UAV network with given <inline-formula> <tex-math …”
Volltext

A (1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius von Cohen, Nachshon, Nutov, Zeev

“… )-approximation algorithm for trees of constant radius. Our algorithm is based on a new decomposition of problem feasible solutions, and on an extension of Steiner Tree …”
Volltext

Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem von Ran, Yingli, Jin, Jianhong, Zhang, Zhao

“… ‐approximation algorithm for the MinIPMC problem …”
Volltext

An approximation algorithm for the prize-collecting connected dominating set problem: An approximation algorithm for the prize-collecting von Zhang, Yaoyao, Zhang, Zhao, Du, Ding-Zhu

“… In this paper, we present an O ( log | V | ) -approximation algorithm for PC-CDS …”
Volltext

An improved approximation algorithm for the discrete Fréchet distance von Chan, Timothy M., Rahmati, Zahed

“… Our f-approximation algorithm runs in time O(nlog⁡n+n2/f2), for any f∈[1,n/log⁡n] and d=O(1), which improves (and, at the same time, slightly simplifies …”
Volltext

A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion von Drescher, Matthew, Fiorini, Samuel, Huynh, Tony

“… )-approximation algorithm, unless P=NP or the Unique Games Conjecture fails. For every ϵ>0, Lokshtanov, Misra, Panolan, Philip, and Saurabh (Lokshtanov et al., 2020 …”
Volltext

An improved approximation algorithm for covering vertices by 4+-paths von Gong, Mingyang, Chen, Zhi-Zhong, Lin, Guohui, Wang, Lusheng

“… ) -time 2-approximation algorithm by applying several time-consuming local improvement operations (Gong et al …”
Volltext

An approximation algorithm for k-level squared metric facility location problem with outliers: An approximation algorithm for k-level von Zhang, Li, Yuan, Jing, Li, Qiaoliang

“… ) where the facilities in path p are opened. Based on primal-dual approximation algorithm and the property of squared metric triangle inequality, we present a constant factor …”
Volltext

A primal–dual approximation algorithm for Minsat von Arif, Umair, Benkoczi, Robert, Gaur, Daya Ram, Krishnamurti, Ramesh

“… ) is the number of variables (clauses). As a by-product, we obtain a 2(1−1∕2k) approximation algorithm for the minimum satisfiability problem where k is the maximum number …”
Volltext

A (1/2+1/60)—Approximation algorithm for Maximum Weight Series-Parallel Subgraph von Călinescu, Gruia, Wang, Xiaolang

“… We improve the approximation ratio for Maximum Weight Series-Parallel Subgraph from 1/2 to 1/2+1/60 …”
Volltext

Exact and approximation algorithms for routing a convoy through a graph: Exact and approximation algorithms for routing a convoy through a graph von van Ee, Martijn, Oosterwijk, Tim, Sitters, René, Wiese, Andreas

“… We study routing problems of a convoy in a graph, generalizing the shortest path problem (SPP), the travelling salesperson problem (TSP), and the Chinese …”
Volltext

A survey of exact and approximation algorithms for linear-parametric optimization problems: A survey of exact and approximation algorithms von Nemesch, Levin, Ruzika, Stefan, Thielen, Clemens, Wittmann, Alina

“… Linear-parametric optimization, where multiple objectives are combined into a single objective using linear combinations with parameters as coefficients, has …”
Volltext

A Fast O(N) Multiresolution Polygonal Approximation Algorithm for GPS Trajectory Simplification von Minjie Chen, Mantao Xu, Franti, P.

“… process for a Web browser. To address this practical problem, we present a fast polygonal approximation algorithm in 2-D space for the GPS trajectory simplification under the so-called integral square synchronous distance …”
Volltext

Approximation algorithms for the k+-star packing problem von Huang, Zhihua, Zhang, An, Gao, Mingqi, Sun, Jiayi, Chen, Yong

“… =2. In this paper, we present an improved algorithm with a tight approximation ratio of 9/5 for k=2, and a k+ …”
Volltext