Search Results - "Sublinear time algorithm"

On Las Vegas approximations for metric 1-median selection by Chang, Ching-Lueh

“…Consider the problem of finding a point in a metric space ({1,2,…,n},d) with the minimum sum of distances to all points. We show that this problem has a…”
Get full text

A lower bound for metric 1-median selection by Chang, Ching-Lueh

“…Consider the problem of finding a point in an n-point metric space with the minimum average distance to all points. We show that this problem has no…”
Get full text

Sublinear Time Algorithm for Online Weighted Bipartite Matching by Hu, Hang, Zhao, Song, Runzhou Tao, Xu, Zhaozhuo, Yin, Junze, Zhuo, Danyang

“…Online bipartite matching is a fundamental problem in online algorithms. The goal is to match two sets of vertices to maximize the sum of the edge weights,…”
Get full text

A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection by Chang, Ching-Lueh

“…We give a deterministic O(hn1+1/h)-time (2h)-approximation nonadaptive algorithm for 1-median selection in n-point metric spaces, where h∈Z+∖{1} is arbitrary…”
Get full text

Fast Neighborhood Rendezvous by Eguchi, Ryota, Kitamura, Naoki, Izumi, Taisuke

“…In the rendezvous problem, two computing entities (called agents) located at different vertices in a graph have to meet at the same vertex. In this paper, we…”
Get full text

On approximating metric 1-median in sublinear time by Wu, Bang Ye

“… •A deterministic sublinear time algorithm for approximating metric 1-median.•A scheme allowing trade-off between computation time and approximation ratio…”
Get full text

Deterministic sublinear-time approximations for metric 1-median selection by Chang, Ching-Lueh

“…Given oracle access to an n-point metric space (M,d), let metric 1-median be the problem of finding argminx∈M∑y∈Md(x,y), breaking ties arbitrarily. We show…”
Get full text

A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling by Assadi, Sepehr, Kapralov, Michael, Khanna, Sanjeev

“…\); the goal is to estimate the number of occurrences of \(H\) in \(G\). Our focus here is on designing sublinear-time algorithms for approximately counting occurrences of \(H\) in \(G…”
Get full text

Evaluating a sublinear-time algorithm for the Minimum Spanning Tree Weight problem by Santi, Gabriele, De Laurentiis, Leonardo

“…We present an implementation and an experimental evaluation of an algorithm that, given a connected graph G (represented by adjacency lists), estimates in…”
Get full text

A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size by Onak, Krzysztof, Ron, Dana, Rosen, Michal, Rubinfeld, Ronitt

“…We give a nearly optimal sublinear-time algorithm for approximating the size of a minimum vertex cover in a graph G…”
Get full text

Almost Optimal Sublinear Time Algorithm for Semidefinite Programming by Garber, Dan, Hazan, Elad

“…We present an algorithm for approximating semidefinite programs with running time that is sublinear in the number of entries in the semidefinite instance. We…”
Get full text

Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time by Zimand, Marius

“… There exists a positive constant α < 1 such that for any function T ( n ) ≤ n α and for any problem L ∈ BPTIME( T ( n )), there exists a deterministic…”
Get full text

A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size by Onak, Krzysztof, Dana, Ron, Rosen, Michal, Rubinfeld, Ronitt

“…We give a nearly optimal sublinear-time algorithm for approximating the size of a minimum vertex cover in a graph G…”
Get full text

Sublinear time width-bounded separators and their application to the protein side-chain packing problem by Fu, Bin, Chen, Zhixiang

“… . In particular, c 3 =1.209. To our best knowledge, this is the first sublinear time algorithm for finding geometric separators…”
Get full text

Separating sublinear time computations by approximate diameter by Fu, Bin, Zhao, Zhiyu

“…We study the problem of separating sublinear time computations via approximating the diameter for a sequence S = p 1 p 2 ⋅⋅⋅ p n of points in a metric space,…”
Get full text

A radar signal sorting algorithm based on improved k-means dynamic clustering and sub linear time algorithm by Li-peng, Gao, Hui-yu, Shan, Feng-you, Ji

“…In order to meet the need of real time, electromagnetic environment became more and more complex and increasing signal flow density, a radar signal sorting…”
Get full text

Sublinear Time Algorithms by Rubinfeld, Ronitt, Shapira, Asaf

“…Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input…”
Get full text

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling by Aliakbarpour, Maryam, Biswas, Amartya Shankha, Gouleakis, Themis, Peebles, John, Rubinfeld, Ronitt, Yodpinyanee, Anak

“…We study the problem of estimating the value of sums of the form S p ≜ ∑ x i p when one has the ability to sample x i ≥ 0 with probability proportional to its…”
Get full text

Sublinear-Time Algorithms for Compressive Phase Retrieval by Li, Yi, Nakos, Vasileios

“… of <inline-formula> <tex-math notation="LaTeX">v\in \mathbb {C} ^{n} </tex-math></inline-formula> coordinate-wise. In this paper we present sublinear-time algorithms…”
Get full text

Sublinear time algorithms for approximate semidefinite programming by Garber, Dan, Hazan, Elad

“…We consider semidefinite optimization in a saddle point formulation where the primal solution is in the spectrahedron and the dual solution is a distribution…”
Get full text