Suchergebnisse - "Randomised approximation algorithms"

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

Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios von Huang, Yongwei, Li, Qiang, Ma, Wing-Kin, Zhang, Shuzhong

“… As a compromise, we present two randomized approximation algorithms for the problem via convex optimization techniques …”
Volltext

Approximation Algorithms for Facility Location and Clustering Problems von Trinh, Khoa

“… The goal is to "open'' the "best'' subset of facilities, subject to certain budget constraints, and connect all clients to the opened facilities so that some objective function of the connection costs is minimized …”
Volltext

Coverage and connectivity in wireless networks von Xu, Xiaohua

“… If all nodes have bounded lives, the problem Max-Life Wireless Cover (MLWC) seeks a wireless coverage schedule of maximum life subject to the life …”
Volltext

A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis von Sun, Jian, Zhang, Zan-Bo, Chen, Yannan, Han, Deren, Du, Donglei, Zhang, Xiaoyan

“… We formulate the MH3C-LU as a ternary quadratic program and present a randomized approximation algorithm based on the complex semidefinite programming relaxation technique …”
Volltext

Influence Maximization with Priority in Online Social Networks von Pham, Canh V., Ha, Dung K. T., Vu, Quang C., Su, Anh N., Hoang, Huan X.

“… The Influence Maximization (IM) problem, which finds a set of k nodes (called seedset) in a social network to initiate the influence spread so that the number …”
Volltext

Robust secondary multicast transmit beamforming for cognitive radio networks under imperfect channel state information von Huang, Yongwei, Li, Qiang, Ma, Wing-Kin, Zhang, Shuzhong

“… As a compromise, we present a randomized approximation algorithm for the problem via convex optimization techniques …”
Volltext

Energy Aware Scheduling for Unrelated Parallel Machines von Angel, E., Bampis, E., Kacem, F.

“… Firstly, we aim to find a non-preemptive schedule of the jobs minimizing the average weighted completion time plus energy, and we propose a randomized approximation algorithm that we derandomize …”
Volltext

Oblivious and Non-Oblivious Local Search for Combinatorial Optimization von Ward, Justin

“… of constrained linear and monotone submodular maximization. First, we give a new, randomized approximation algorithm for maximizing a monotone submodular function subject to a matroid constraint …”
Volltext

Randomized approximation of bounded multicovering problems von Peleg, D., Schechtman, G., Wool, A.

Volltext