Výsledky vyhledávání - "Efficient approximation algorithms"

Efficient approximation algorithms for scheduling moldable tasks Autor Wu, Xiaohu, Loiseau, Patrick

“…•We study scheduling independent moldable tasks under the proposed (δj,kj)-monotonic model, whose generality is between the classic monotonic and…”
Získat plný text

Efficient approximation algorithms for adaptive influence maximization Autor Huang, Keke, Tang, Jing, Han, Kai, Xiao, Xiaokui, Chen, Wei, Sun, Aixin, Tang, Xueyan, Lim, Andrew

“…Given a social network G and an integer k , the influence maximization (IM) problem asks for a seed set S of k nodes from G to maximize the expected number of…”
Získat plný text

Multicell Coordinated Beamforming With Rate Outage Constraint-Part II: Efficient Approximation Algorithms Autor Li, Wei-Chiang, Chang, Tsung-Hui, Chi, Chong-Yung

“…This paper studies the coordinated beamforming (CoBF) design for the multiple-input single-output interference channel, provided that only channel distribution…”
Získat plný text

Efficient Approximation Algorithms for Server Allocation to Minimize Total Capacity under Server Failure Autor Inoue, Masahiro, Oki, Eiji

“…Real-time applications, such as ticket booking systems, video streaming systems, social networking services, and online games, are prevalent nowadays. Low…”
Získat plný text

Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds Autor Guo, Longkun, Shen, Hong

“…Clouds, such as Amazon Infrastructure-as-a-Service (IaaS) clouds and EMC Hybrid Cloud, impose growing requirements of resource-efficiency scheduling. The…”
Získat plný text

Efficient Approximation Algorithms for Scheduling Coflows With Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time Autor Chen, Chi-Yeh

“…This article focuses on the problem of coflow scheduling with precedence constraints in identical parallel networks, a well-known <inline-formula><tex-math…”
Získat plný text

Efficient Approximation Algorithms for Several Positive Influence Dominating Set Problems in Social Networks Autor Zhong, Hao, Li, Weisheng, Zhang, Qi, Lin, Ronghua, Tang, Yong

“…Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The…”
Získat plný text

Adaptive CSMA Under the SINR Model: Efficient Approximation Algorithms for Throughput and Utility Maximization Autor Swamy, Peruru Subrahmanya, Ganti, Radha Krishna, Jagannathan, Krishna

“…We consider a carrier sense multiple access (CSMA)-based scheduling algorithm for a single-hop wireless network under a realistic…”
Získat plný text

Efficient Approximation Algorithms for Scheduling Coflows With Total Weighted Completion Time in Identical Parallel Networks Autor Chen, Chi-Yeh

“…This article addresses the scheduling problem of coflows in identical parallel networks, a well-known <inline-formula><tex-math notation="LaTeX">\mathcal…”
Získat plný text

Efficient approximation algorithms for offline and online unit disk multiple coverage Autor Gao, Xuening, Guo, Longkun, Liao, Kewen

“…Multiple coverage with unit disks is a problem widely seen in monitoring applications of wireless sensor networks. In this problem, let T=t1,t2,…,tn be a set…”
Získat plný text

Efficient Approximation Algorithms for Adaptive Target Profit Maximization Autor Huang, Keke, Tang, Jing, Xiao, Xiaokui, Sun, Aixin, Lim, Andrew

“…Given a social network G, the profit maximization (PM) problem asks for a set of seed nodes to maximize the profit, i.e., revenue of influence spread less the…”
Získat plný text

Efficient approximation algorithms for the routing open shop problem Autor Chernykh, Ilya, Kononov, Alexander, Sevastyanov, Sergey

“…We consider the routing open shop problem being a generalization of two classical discrete optimization problems: the open shop scheduling problem and the…”
Získat plný text

Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs Autor Obata, Yuji, Nishizeki, Takao

“… In the paper, we present four efficient approximation algorithms for the problem, which have theoretical performance guarantees for the computation time, the span of a found b-coloring and the approximation ratio. We also obtain several upper bounds on the minimum span, expressed in terms of the maximum b-degrees, one of which is an extension of Brooks' theorem on an ordinary coloring…”
Získat plný text

Efficient approximation algorithms for computing k disjoint constrained shortest paths Autor Guo, Longkun

“…Let G = ( V , E ) be a given directed graph in which every edge e is associated with two nonnegative costs: a weight w ( e ) and a length l ( e ). For a pair…”
Získat plný text

Building Integrated Ontological Knowledge Structures with Efficient Approximation Algorithms Autor Xiang, Yang, Janga, Sarath Chandra

“… In this work, we focus on the integration of ontologies with hierarchical structures. We identifiedoptimal structures in this problem and proposed optimal and efficient approximation algorithms forintegrating a pair of ontologies…”
Získat plný text

Efficient Approximation Algorithms for Chemical Mechanical Polishing Dummy Fill Autor Feng, Chunyang, Zhou, Hai, Yan, Changhao, Tao, Jun, Zeng, Xuan

“…To reduce chip-scale topography variation in chemical mechanical polishing process, dummy fill is widely used to improve the layout density uniformity…”
Získat plný text

Efficient Approximation Algorithms for Influence Maximization and Its Variants Autor Guo, Qintian

“…In modern society, online social networks have emerged as fundamental channels for communication and the dissemination of information. Platforms such as…”
Získat plný text

Efficient approximation algorithms for shortest cycles in undirected graphs Autor Lingas, Andrzej, Lundell, Eva-Marta

“…We describe a simple combinatorial approximation algorithm for finding a shortest (simple) cycle in an undirected graph. Given an adjacency-list representation…”
Získat plný text

Efficient approximation algorithms for clustering point-sets Autor Xu, Guang, Xu, Jinhui

“…In this paper, we consider the problem of clustering a set of n finite point-sets in d-dimensional Euclidean space. Different from the traditional clustering…”
Získat plný text

Efficient approximation algorithms for the routing open shop problem : Transport Scheduling Autor CHERNYKH, Ilya, KONONOV, Alexander, SEVASTYANOV, Sergey

Získat plný text