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

“…Issue Title: Special Issue on Learning Theory We consider a framework of sample-based clustering. In this setting, the input to a clustering algorithm is a…”
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. Our…”
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. A directed graph is called a…”
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

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. We develop methods for constructing them for any class of…”
Get full text

Estimating Graph Parameters from Random Order Streams by Pan, Peng, Sohler, Christian

“…We develop a new algorithmic technique that allows to transfer some constant time approximation algorithms for general graphs into random order streaming algorithms…”
Get full text

Testable Bounded Degree Graph Properties Are Random Order Streamable by Monemizadeh, Morteza, Muthukrishnan, S, Pan, Peng, Sohler, Christian

“… We then show that our approach can also be applied to constant time approximation algorithms for bounded degree graphs in the adjacency list model…”
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

Profile-based optimal stable matchings in the Roommates problem by Simola, Sofia, Manlove, David

“…The stable roommates problem can admit multiple different stable matchings. We have different criteria for deciding which one is optimal, but computing those…”
Get full text

Trust and Profit Sensitive Ranking for the Deep Web and On-line Advertisements by Balakrishnan, Raju

“…Ranking is of definitive importance to both usability and profitability of web information systems. While ranking of results is crucial for the accessibility…”
Get full text

Borel oracles. An analytical approach to constant-time algorithms by Elek, Gabor, Lippner, Gabor

“… In this paper we illustrate the power of this tool to prove the existence of the above mentioned constant-time approximation algorithm…”
Get full text

Constant-Time Algorithms for Sparsity Matroids by Ito, Hiro, Tanigawa, Shin-ichi, Yoshida, Yuichi

“…\). In this paper, we give a constant-time approximation algorithm for the rank of the sparsity matroid of a degree-bounded undirected graph…”
Get full text