Search Results - Constant-time approximation algorithms

Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems by Yoshida, Yuichi, Yamamoto, Masaki, Ito, Hiro

“…We study constant-time approximation algorithms for bounded-degree graphs, which run in time independent of the number of vertices $n…”
Get full text

A framework for statistical clustering with constant time approximation algorithms for K-median and K-means clustering by Shai, Ben-David

“… In this setting, the input to a clustering algorithm is a sample generated i.i.d by some unknown arbitrary distribution…”
Get full text

Constant-Time Approximation Algorithms via Local Improvements by Nguyen, H.N., Onak, K.

“…We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution…”
Get full text

A framework for statistical clustering with constant time approximation algorithms for K-median and K -means clustering : Learning theory by BEN-DAVID, Shai

Get full text

Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs by Kusumoto, M., Yoshida, Y., Ito, H.

“…We propose constant-time algorithms for approximating the weight of the maximum weight branching in the general graph model…”
Get full text

Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree CSP by Yoshida, Yuichi

“… for it. In this paper, we show that similar results hold for constant-time approximation algorithms in the bounded-degree model…”
Get full text

On Perturbation Resilience of Non-uniform k-Center by Bandyapadhyay, Sayan

“… On the other hand, they designed a “bi-criteria” constant approximation algorithm that uses a constant times k balls…”
Get full text

No sublogarithmic-time approximation scheme for bipartite vertex cover by Göös, Mika, Suomela, Jukka

“…—that no sublogarithmic-time approximation scheme exists for the dual problem: there is a constant δ > 0 so that no randomised distributed algorithm with running time o ( log n ) can find a ( 1 + δ…”
Get full text

Distributed Approximate Matching by Lotker, Zvi, Patt-Shamir, Boaz, Rosén, Adi

“… Their main result is a randomized ... -approximation distributed algorithm for maximum weighted matching, whose running time is ... for any constant…”
Get full text

Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs by Qian-Ping, Gu, Xu, Gengchun

“… and improves the previous \(\min\{O(n^{1+\epsilon}),O(nk^2)\}\) (\(\epsilon>0\) is a constant) time constant-factor approximations…”
Get full text

Online Scheduling with Bounded Migration by Sanders, Peter, Sivadasan, Naveen, Skutella, Martin

“… We also present a linear time "online approximation scheme," that is, a family of online algorithms with competitive ratio arbitrarily close to 1 and constant…”
Get full text

Constant-Time Dynamic \((\Delta+1)\)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing by Henzinger, Monika, Pan, Peng

“… testing can lead to constant-time fully dynamic graph algorithms we prove the following results: (1…”
Get full text

Constant time approximation scheme for largest well predicted subset by Fu, Bin, Wang, Lusheng

“…The largest well predicted subset problem is formulated for comparison of two predicted 3D protein structures from the same sequence. A 3D protein structure is…”
Get full text

Local Graph Partitions for Approximation and Testing by Hassidim, A., Kelner, J.A., Nguyen, H.N., Onak, K.

“…We introduce a new tool for approximation and testing algorithms called partitioning oracles…”
Get full text

Set covering in fuel-considered vehicle routing problems by Song, Liang, Chen, Haibin, Gu, Hao, Huang, Hejiao, Du, Hongwei

“… We give a bicriteria approximation algorithm for this problem. Secondly, we study the set covering in the FVRP with distance constraint and constant time windows (FVRP-CTW…”
Get full text

Tiling and PCA Strategy for Clustering-Based High-Dimensional Gaussian Filtering by Oishi, Sou, Fukushima, Norishige

“… We accelerate HDGF by clustering-based constant-time algorithm, which has O ( K ) order for convolution, where K is the number of clusters…”
Get full text

Finding diameter-reducing shortcuts in trees by Bilò, Davide, Gualà, Luciano, Leucci, Stefano, Pepè Sciarria, Luca

“…>0, we design a linear-time (1+ε)-approximation algorithm for paths when k=o(log⁡n), thus establishing a dichotomy between paths and trees for k…”
Get full text

Almost Stable Matchings by Truncating the Gale–Shapley Algorithm by Floréen, Patrik, Kaski, Petteri, Polishchuk, Valentin, Suomela, Jukka

“… We apply our results to give a distributed (2+ ε )-approximation algorithm for maximum-weight matching in bicoloured graphs and a centralised randomised constant-time approximation scheme for estimating the size of a stable matching…”
Get full text

Click efficiency: a unified optimal ranking for online Ads and documents by Balakrishnan, Raju, Kambhampati, Subbarao

“…Ranking of search results and ads has traditionally been studied separately. The probability ranking principle is commonly used to rank the search results…”
Get full text

A modified Milstein scheme for approximation of stochastic delay differential equations with constant time lag by Hofmann, Norbert, Müller-Gronbach, Thomas

“…We introduce a modified Milstein scheme for pathwise approximation of scalar stochastic delay differential equations with constant time lag on a fixed finite time interval…”
Get full text