Suchergebnisse - "dual approximation algorithm"

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

“… We characterize the optimal solution to the linear programming relaxation of the standard formulation for the minimum satisfiability problem. We give a O(nm2) …”
Volltext

A primal–dual approximation algorithm for the vertex cover P 3 problem von Tu, Jianhua, Zhou, Wenli

“… We introduce the vertex cover P n ( V C P n ) problem, that is, the problem of finding a minimum weight set F ⊂ V such that the graph G [ V − F ] has no P n , …”
Volltext

A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem von Liu, Xiaofei, Li, Weidong, Xie, Runtao

“… In this paper, we introduce the k -prize-collecting minimum power cover problem ( k -PCPC). In this problem, we are given a point set V , a sensor set S on a …”
Volltext

An improved primal-dual approximation algorithm for the k-means problem with penalties von Ren, Chunying, Xu, Dachuan, Du, Donglei, Li, Min

“… In the k-means problem with penalties, we are given a data set $${\cal D} \subseteq \mathbb{R}^\ell $$ of n points where each point $$j \in {\cal D}$$ is …”
Volltext

A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties von LIU, Xiaofei, LI, Weidong, YANG, Jinhua

“… In this paper, we consider the k -prize-collecting minimum vertex cover problem with submodular penalties, which generalizes the well-known minimum vertex …”
Volltext

A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties von Du, Donglei, Lu, Ruixing, Xu, Dachuan

“… We consider the facility location problem with submodular penalties (FLPSP), introduced by Hayrapetyan et al. (Proceedings of the Sixteenth Annual ACM-SIAM …”
Volltext

Primal–dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach von Wu, Chenchen, Du, Donglei, Xu, Dachuan

“… As a demonstration, our primal–dual approximation algorithm can be easily adapted to several variants of the 2-LFLP, including models with stochastic scenario, dynamically …”
Volltext

A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem von Bae, Jungyun, Rathinam, Sivakumar

“… Surveillance applications require a collection of heterogeneous vehicles to visit a set of targets. We consider a fundamental routing problem that arises in …”
Volltext

A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses von Mestre, Julián

“… We study the partial vertex cover problem. Given a graph G =( V , E ), a weight function w : V → R + , and an integer s , our goal is to cover all but s edges, …”
Volltext

Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs von Wu, Fangfang, Zhang, Run, Zhang, Xiandong

“… This paper examines task scheduling in homogeneous multi-cluster platforms, equipped with Graphics Processing Units (GPUs), with the aim of minimizing the …”
Volltext

A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP von Nguyen, Viet Hung

“… We present a primal-dual ⌈log( n )⌉-approximation algorithm for the version of the asymmetric prize collecting traveling salesman problem, where the objective …”
Volltext

A 6.55 factor primal-dual approximation algorithm for the connected facility location problem von Jung, Hyunwoo, Hasan, Mohammad Khairul, Chwa, Kyung-Yong

“… In the connected facility location (ConFL) problem, we are given a graph G =( V , E ) with nonnegative edge cost c e on the edges, a set of facilities ℱ⊆ V , …”
Volltext

A primal-dual approximation algorithm for the vertex cover P3 problem von JIANHUATU, WENLI ZHOU

Volltext

A primal-dual -approximation algorithm for the stochastic facility location problem with submodular penalties von Xu, Dachuan, Gao, Dongxiao, Wu, Chenchen

Volltext

Jamming-Based Covert Communication for Rate-Splitting Multiple Access von Nguyen, Trung Thanh, Luong, Nguyen Cong, Feng, Shaohan, Elbassioni, Khaled, Niyato, Dusit

“… We investigate secure communications for a rate-splitting multiple access (RSMA) system. In particular, a jamming-based covert communication (CC) technique is …”
Volltext

A primal-dual approximation algorithm for stochastic facility location problem with service installation costs von Wang, Xing, Xu, Dachuan, Zhao, Xinyuan

“… We consider the stochastic version of the facility location problem with service installation costs. Using the primal-dual technique, we obtain a …”
Volltext

Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms von Wu, Fangfang, Jiang, Zhongyi, Zhang, Run, Zhang, Xiandong

“… We consider scheduling monotonic moldable tasks on multiple platforms, where each platform contains a set of processors. A moldable task can be split into …”
Volltext

A Note on Submodular Function Minimization with Covering Type Linear Constraints von Kamiyama, Naoyuki

“… 1 -approximation algorithm. In this paper, we propose a new polynomial-time primal-dual approximation algorithm based on the approximation algorithm of Takazawa and Mizuno for the covering integer program with { 0 , 1 …”
Volltext

A primal–dual approximation algorithm for the survivable network design problem in hypergraphs von Zhao, Liang, Nagamochi, Hiroshi, Ibaraki, Toshihide

“… Given a hypergraph with nonnegative costs on hyperedges, and a weakly supermodular function r : 2 V→ Z + , where V is the vertex set, we consider the problem …”
Volltext

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph von Liang Zhao, Toshihide Ibaraki, Hiroshi Nagamochi

Volltext