Výsledky vyhľadávania - "Approximation algorithm"

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

“…We consider the capacitated cycle covering problem : given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to…”
Získať plný text

Performance of a Distributed Stochastic Approximation Algorithm Autor Bianchi, Pascal, Fort, Gersende, Hachem, Walid

“…In this paper, a distributed stochastic approximation algorithm is studied. Applications of such algorithms include decentralized estimation, optimization, control or computing…”
Získať plný text

A Bifactor Approximation Algorithm for Cloudlet Placement in Edge Computing Autor Bhatta, Dixit, Mashayekhy, Lena

“…Emerging applications with low-latency requirements such as real-time analytics, immersive media applications, and intelligent virtual assistants have rendered…”
Získať plný text

Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs Autor 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…”
Získať plný text

An improved approximation algorithm for Hypergraph Max p-Section Autor 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…”
Získať plný text

A -approximation algorithm for scheduling on two parallel machines with job delivery coordination Autor 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…”
Získať plný text

An approximation algorithm for bus evacuation problem Autor Feng, Yuanyuan, Cao, Yi, Yang, Shuanghua, Yang, Lili, Wei, Tangjian

“… Therefore, it is efficacious and requisite to use an approximation algorithm such that a sub-optimal plan can be derived quickly in large-scale disasters…”
Získať plný text

A (1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius Autor 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…”
Získať plný text

A tight approximation algorithm for the cluster vertex deletion problem Autor Aprile, Manuel, Drescher, Matthew, Fiorini, Samuel, Huynh, Tony

“…We give the first 2-approximation algorithm for the cluster vertex deletion problem. This approximation factor is tight, since approximating the problem within…”
Získať plný text

An approximation algorithm for multi-allocation hub location problems Autor Jost, Niklas

“… In this paper, an approximation algorithm to solve these problems is developed, which improves…”
Získať plný text

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

“…‐approximation algorithm for the MinIPMC problem…”
Získať plný text

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

“… + 1 , where l is the maximum size of all hyperedges. As a result, we obtain an ( l + 1 + min { k , Δ } ) -approximation algorithm for the k -prize-collecting hitting set problem based on the two algorithms mentioned above…”
Získať plný text

An Approximation Algorithm for the h -Hop Independently Submodular Maximization Problem and Its Applications Autor 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…”
Získať plný text

Approximation Algorithm and Applications for Connected Submodular Function Maximization Problems Autor Wang, Ziming, Li, Jing, Xue, He, Xu, Wenzheng, Liang, Weifa, Xu, Zichuan, Peng, Jian, Zhou, Pan, Jia, Xiaohua, Das, Sajal K.

“…In this paper, we study a connected submodular function maximization problem, which arises from many applications including deploying UAV networks to serve…”
Získať plný text

Approximation algorithm and mechanism design for bisubmodular welfare maximization problem Autor Wang, Yuanyuan, Nong, Qingqin, Liu, Wenjing, Fang, Qizhi

“…In a combinatorial auction, m indivisible items are sold to multiple buyers. This paper explores the welfare maximization problem in combinatorial auctions…”
Získať plný text

An approximation algorithm for graph partitioning via deterministic annealing neural network Autor Wu, Zhengtian, Karimi, Hamid Reza, Dang, Chuangyin

“…Graph partitioning, a classical NP-hard combinatorial optimization problem, is widely applied to industrial or management problems. In this study, an…”
Získať plný text

An improved approximation algorithm for scheduling monotonic moldable tasks Autor Wu, Fangfang, Zhang, Xiandong, Chen, Bo

“… We present an efficient (3/2)-approximation algorithm with time complexity O(nmlog(nm)) (for m>n) and O(n2logn) (for m≤n). To the best of our knowledge, the best relevant known results…”
Získať plný text

A 1.488 approximation algorithm for the uncapacitated facility location problem Autor Li, Shi

“…We present a 1.488-approximation algorithm for the metric uncapacitated facility location (UFL) problem. Previously, the best algorithm was due to Byrka…”
Získať plný text

A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion Autor 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…”
Získať plný text

Approximation algorithm for dynamic facility location problem Autor Zhang, Li, Li, Qiaoliang

“…In this paper, we consider dynamic facility location problem with unit demand (DFLPUD). We propose a 1.52-approximation algorithm that skillfully integrates…”
Získať plný text