Search Results - "randomized approximation algorithm"

A randomized approximation algorithm for metric triangle packing by Chen, Yong, Chen, Zhi-Zhong, Lin, Guohui, Wang, Lusheng, Zhang, An

“…Given an edge-weighted complete graph G on 3 n vertices, the maximum-weight triangle packing problem asks for a collection of n vertex-disjoint triangles in G…”
Get full text

A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times by Badri, Hossein, Bahreini, Tayebeh, Grosu, Daniel

“…•A new a parallel randomized approximation algorithm for the non-preemptive single machine scheduling problem with release dates and delivery times…”
Get full text

A randomized approximation algorithm for the minimal-norm static-output-feedback problem by Peretz, Yossi (Joseph)

“…A new randomized algorithm is suggested, for extracting static-output-stabilizing-feedbacks, with approximately minimal-norm, for LTI systems. The algorithm…”
Get full text

A linear time randomized approximation algorithm for Euclidean matching by Imanparast, Mahdi, Hashemi, Seyed Naser

“… We propose a simple randomized approximation algorithm based on the geometrical aspect of the problem with O ( n ) expected time…”
Get full text

An improved randomized approximation algorithm for maximum triangle packing by Chen, Zhi-Zhong, Tanahashi, Ruka, Wang, Lusheng

“…This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm…”
Get full text

A randomized approximation algorithm for computing bucket orders by Ukkonen, Antti, Puolamäki, Kai, Gionis, Aristides, Mannila, Heikki

“…We show that a simple randomized algorithm has an expected constant factor approximation guarantee for fitting bucket orders to a set of pairwise preferences…”
Get full text

Erratum to “An improved randomized approximation algorithm for maximum triangle packing” [Discrete Appl. Math. 157 (2009) 1640–1646] by Chen, Zhi-Zhong, Tanahashi, Ruka, Wang, Lusheng

Get full text

An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance by Xu, BaoGang, Yu, XingXing, Zhang, XiaoYan, Zhang, Zan-Bo

“…）, Max Set Splitting, Max Ek-Set Splitting and Max Hypergraph Bisection. By generalizing several earlier ideas, we present an SDP randomized approximation algorithm…”
Get full text

Minimal Cost Server Configuration for Meeting Time-Varying Resource Demands in Cloud Centers by Liu, Chubo, Li, Kenli, Li, Keqin

“…We consider the minimal cost server configuration for meeting resource demands over multiple time slots. Specifically, there are some heterogeneous servers…”
Get full text

A Parallel Randomized Approximation Algorithm for Single Machine Scheduling with Applications to Flow Shop Scheduling by Badri, Hossein

“… them. We design a parallel randomized approximation algorithm for the non-preemptive single machine scheduling problem with release dates and delivery times (1|rj,qj|Cmax…”
Get full text

Approximation Algorithms for Online User Association in Multi-Tier Multi-Cell Mobile Networks by Weng Chon Ao, Psounis, Konstantinos

“…The constantly growing wireless bandwidth demand is pushing wireless networks to multi-tier architectures consisting of a macrocell tier and a number of dense…”
Get full text

A sublinear-time randomized approximation algorithm for matrix games by Grigoriadis, Michael D., Khachiyan, Leonid G.

“…This paper presents a parallel randomized algorithm which computes a pair of ε-optimal strategies for a given ( m, n)-matrix game A = [ a ij ] ϵ [−1, 1] in O(…”
Get full text

An Improved Randomized Approximation Algorithm for Max TSP by Chen, Zhi-Zhong, Wang, Lusheng

Get full text

Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem by Kuroki, Yusuke, Matsui, Tomomi

Get full text

A Distributed Information Divergence Estimation over Data Streams by Anceaume, Emmanuelle, Busnel, Yann

“…In this paper, we consider the setting of large scale distributed systems, in which each node needs to quickly process a huge amount of data received in the…”
Get full text

A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem by Gehweiler, Joachim, Lammersen, Christiane, Sohler, Christian

“…We investigate a metric facility location problem in a distributed setting. In this problem, we assume that each point is a client as well as a potential…”
Get full text

A Randomized Approximation Algorithm of Logic Sampling by R Martin Chavez, Cooper, Gregory F

“…In recent years, researchers in decision analysis and artificial intelligence (AI) have used Bayesian belief networks to build models of expert opinion. Using…”
Get full text

Uniform node sampling service robust against collusions of malicious nodes by Anceaume, Emmanuelle, Busnel, Yann, Sericola, Bruno

“…We consider the problem of achieving uniform node sampling in large scale systems in presence of a strong adversary. We first propose an omniscient strategy…”
Get full text

Approximation algorithms for maximum cut with limited unbalance by Galbiati, Giulia, Maffioli, Francesco

“… We present polynomial time randomized approximation algorithms with non trivial performance guarantees for its solution…”
Get full text

A Distributed Algorithm for the Facility Location Problem by Gehweiler, Joachim, Lammersen, Christiane, Sohler, Christian

Get full text