Constant-Time Approximation Algorithms via Local Improvements

2008 49th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2008.81 ◽

2008 ◽

Cited By ~ 55

Author(s):

Huy N. Nguyen ◽

Krzysztof Onak

Keyword(s):

Approximation Algorithms ◽

Constant Time ◽

Time Approximation

Download Full-text

A Framework for Statistical Clustering with a Constant Time Approximation Algorithms for K-Median Clustering

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_29 ◽

2004 ◽

pp. 415-426 ◽

Cited By ~ 3

Author(s):

Shai Ben-David

Keyword(s):

Approximation Algorithms ◽

Constant Time ◽

Time Approximation ◽

Statistical Clustering

Download Full-text

Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems

SIAM Journal on Computing ◽

10.1137/110828691 ◽

2012 ◽

Vol 41 (4) ◽

pp. 1074-1093 ◽

Cited By ~ 10

Author(s):

Yuichi Yoshida ◽

Masaki Yamamoto ◽

Hiro Ito

Keyword(s):

Approximation Algorithms ◽

Optimization Problems ◽

Constant Time ◽

Time Approximation

Download Full-text

A framework for statistical clustering with constant time approximation algorithms for K-median and K-means clustering

Machine Learning ◽

10.1007/s10994-006-0587-3 ◽

2006 ◽

Vol 66 (2-3) ◽

pp. 243-257 ◽

Cited By ~ 8

Author(s):

Shai Ben-David

Keyword(s):

Approximation Algorithms ◽

Constant Time ◽

Time Approximation ◽

Statistical Clustering

Download Full-text

Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs

International Journal of Networking and Computing ◽

10.15803/ijnc.3.2_205 ◽

2013 ◽

Vol 3 (2) ◽

pp. 205-216

Author(s):

Mitsuru Kusumoto ◽

Yuichi Yoshida ◽

Hiro Ito

Keyword(s):

Approximation Algorithms ◽

Constant Time ◽

Sparse Graphs ◽

Time Approximation ◽

Branching Problem

Download Full-text

Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs

2012 Third International Conference on Networking and Computing ◽

10.1109/icnc.2012.78 ◽

2012 ◽

Author(s):

Mitsuru Kusumoto ◽

Yuichi Yoshida ◽

Hiro Ito

Keyword(s):

Approximation Algorithms ◽

Constant Time ◽

Sparse Graphs ◽

Time Approximation ◽

Branching Problem

Download Full-text

Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP

Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 ◽

10.1145/1993636.1993725 ◽

2011 ◽

Cited By ~ 5

Author(s):

Yuichi Yoshida

Keyword(s):

Approximation Algorithms ◽

Constant Time ◽

Bounded Degree ◽

Time Approximation ◽

Optimal Constant

Download Full-text

Constant-Time Approximation Algorithms for the Knapsack Problem

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-29952-0_17 ◽

2012 ◽

pp. 131-142 ◽

Cited By ~ 4

Author(s):

Hiro Ito ◽

Susumu Kiyoshima ◽

Yuichi Yoshida

Keyword(s):

Approximation Algorithms ◽

Knapsack Problem ◽

Constant Time ◽

Time Approximation

Download Full-text

C7.3 - Polynomial Time Approximation Algorithms for Localization based on Unknown Signals

10.5162/sensor2013/c7.3 ◽

2013 ◽

Author(s):

Ch. Schindelhauer ◽

J. Wendeberg

Keyword(s):

Approximation Algorithms ◽

Polynomial Time ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Polynomial Time Approximation Algorithms for Localization Based on Unknown Signals

Algorithms for Sensor Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-36092-3_15 ◽

2013 ◽

pp. 132-143

Author(s):

Johannes Wendeberg ◽

Christian Schindelhauer

Keyword(s):

Approximation Algorithms ◽

Polynomial Time ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Polynomial-time approximation algorithms for the coloring problem in some cases

Journal of Combinatorial Optimization ◽

10.1007/s10878-016-0008-x ◽

2016 ◽

Vol 33 (3) ◽

pp. 809-813 ◽

Cited By ~ 4

Author(s):

D. S. Malyshev

Keyword(s):

Approximation Algorithms ◽

Polynomial Time ◽

Time Approximation ◽

Coloring Problem ◽

Polynomial Time Approximation

Download Full-text