Search Results - Randomised and approximation algorithms

Parameterised counting complexity theory by Roth, Marc

“…A little more than two decades ago, Flum and Grohe (STOC 02), and McCartin (MFCS 02) introduced the structural foundations of parameterised counting complexity…”
Get full text

Randomized Milstein algorithm for approximation of solutions of jump–diffusion SDEs by Przybyłowicz, Paweł, Schwarz, Verena, Szölgyenyi, Michaela

Get full text

Computational drug repositioning using low-rank matrix approximation and randomized algorithms by Luo, Huimin, Li, Min, Wang, Shaokai, Liu, Quan, Li, Yaohang, Wang, Jianxin

“… Under this assumption, the matrix completion algorithm fills out the unknown…”
Get full text

Randomized approximation algorithms for monotone k-submodular function maximization with constraints by Li, Yuying, Li, Min, Zhou, Yang, Niu, Shuxian, Liu, Qian

“… or detection efficiency. This paper first proposes two randomized algorithms aimed at improving the approximation ratio for maximizing monotone k -submodular functions under matroid constraints and individual size constraints…”
Get full text

A randomised approximation algorithm for the hitting set problem by El Ouali, Mourad, Fohlin, Helena, Srivastav, Anand

“… The hitting set problem is to find a hitting set of minimum cardinality. It is known that an approximation ratio of l can be achieved easily…”
Get full text

Randomized algorithms for the computation of multilinear rank-(μ1,μ2,μ3) approximations by Che, Maolin, Wei, Yimin, Xu, Yanwei

“…We present some randomized algorithms for computing multilinear rank- ( μ 1 , μ 2 , μ 3 ) approximations of tensors by combining the sparse subspace embedding and the singular value decomposition…”
Get full text

Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands by Chaturvedi, Anya, Chekuri, Chandra, Liu, Mengxue, Richa, Andrea W., Rost, Matthias, Schmid, Stefan, Weber, Jamison

“…Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem - the…”
Get full text

Randomized approximation algorithms for planar visibility counting problem by Alipour, Sharareh, Ghodsi, Mohammad, Jafari, Amir

“… Gudmundsson and Morin (2010) [10] proposed a 2-approximation algorithm for this problem with a tradeoff between the space and the query time. For any constant 0≤α…”
Get full text

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

“… Our algorithm is randomized and achieves an expected approximation ratio of 0.66768 - ϵ for any constant ϵ > 0 …”
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…”
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

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

Randomized algorithms for the approximations of Tucker and the tensor train decompositions by Che, Maolin, Wei, Yimin

“… We give an adaptive randomized algorithm for the computation of a low multilinear rank approximation of the tensors with unknown multilinear rank and analyze its probabilistic error bound under certain assumptions…”
Get full text

A fast randomized algorithm for the approximation of matrices by Woolfe, Franco, Liberty, Edo, Rokhlin, Vladimir, Tygert, Mark

“…We introduce a randomized procedure that, given an m × n matrix A and a positive integer k, approximates A with a matrix Z of rank k…”
Get full text

Randomized algorithms for the low-rank approximation of matrices by Liberty, Edo, Woolfe, Franco, Martinsson, Per-Gunnar, Rokhlin, Vladimir, Tygert, Mark

“…We describe two recently proposed randomized algorithms for the construction of low-rank approximations to matrices, and demonstrate their application (inter alia…”
Get more information

Subspace-orbit randomized algorithms for low rank approximations of third-order tensors in t-product format by Wang, Xuezhong, Wang, Kai, Mo, Changxin

“… Given a truncated term K, we derive randomized algorithms for approximating the K-term t-SVD, which is called as the subspace-orbit randomized t-SVD (sort-SVD…”
Get full text

Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence by van Ieperen, Femke, Kryven, Ivan

“…We discuss sequential stub matching for directed graphs and show that this process can be used to sample simple digraphs with asymptotically equal probability…”
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