Výsledky vyhledávání - "Randomized Approximation Algorithm"

Randomized approximation algorithms for monotone k-submodular function maximization with constraints Autor 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…”
Získat plný text

A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis Autor 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…”
Získat plný text

Influence Maximization with Priority in Online Social Networks Autor 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…”
Získat plný text

Robust secondary multicast transmit beamforming for cognitive radio networks under imperfect channel state information Autor 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…”
Získat plný text

Energy Aware Scheduling for Unrelated Parallel Machines Autor 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…”
Získat plný text

Oblivious and Non-Oblivious Local Search for Combinatorial Optimization Autor 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…”
Získat plný text

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

Získat plný text

Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios Autor 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…”
Získat plný text

Approximation Algorithms for Facility Location and Clustering Problems Autor 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…”
Získat plný text

Coverage and connectivity in wireless networks Autor 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…”
Získat plný text