Výsledky vyhledávání - "Constant-time approximation algorithms"

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

Autoři: Hiro Ito Masaki Yamamoto Yuichi Yoshida

Zdroj: SIAM Journal on Computing. 41:1074-1093

Témata: 0102 computer and information sciences, 01 natural sciences

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

Autoři: Yuichi Yoshida

Zdroj: Proceedings of the forty-third annual ACM symposium on Theory of computing. :665-674

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/1006.3368
http://arxiv.org/abs/1006.3368
http://portal.acm.org/citation.cfm?doid=1993636.1993725
https://doi.org/10.1145/1993636.1993725
https://dl.acm.org/doi/10.1145/1993636.1993725
https://core.ac.uk/display/104161137
https://dblp.uni-trier.de/db/journals/corr/corr1006.html#abs-1006-3368
https://www.arxiv-vanity.com/papers/1006.3368/

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

Autoři: Yuichi Yoshida Hiro Ito Mitsuru Kusumoto

Zdroj: International Journal of Networking and Computing. 3:205-216

Témata: 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: https://www.jstage.jst.go.jp/article/ijnc/3/2/3_205/_pdf
https://ieeexplore.ieee.org/document/6424604/
http://www.ijnc.org/index.php/ijnc/article/download/63/62
http://www.ijnc.org/index.php/ijnc/article/view/63
https://www.jstage.jst.go.jp/article/ijnc/3/2/3_205/_article
https://dblp.uni-trier.de/db/conf/ic-nc/ic-nc2012.html#KusumotoYI12
https://www.computer.org/csdl/proceedings-article/icnc/2012/4893a407/12OmNBKmXt9

Constant-Time Approximation Algorithms via Local Improvements

Autoři: Huy N. Nguyen Krzysztof Onak

Zdroj: 2008 49th Annual IEEE Symposium on Foundations of Computer Science. :327-336

Témata: 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: https://ieeexplore.ieee.org/document/4690966/
https://onak.pl/download/publications/Nguyen_Onak-constant_time_approximation.pdf
http://onak.pl/download/publications/Nguyen_Onak-constant_time_approximation.pdf
https://doi.org/10.1109/FOCS.2008.81
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004690966
http://ieeexplore.ieee.org/document/4690966/

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

Autoři: Shai Ben-David

Zdroj: Machine Learning. 66:243-257

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2Fs10994-006-0587-3.pdf
https://link.springer.com/content/pdf/10.1007%2Fs10994-006-0587-3.pdf
https://link.springer.com/article/10.1007/s10994-006-0587-3
https://dblp.uni-trier.de/db/journals/ml/ml66.html#Ben-David07
https://paperity.org/p/7521621/a-framework-for-statistical-clustering-with-constant-time-approximation-algorithms-for-k
https://doi.org/10.1007/s10994-006-0587-3
https://dl.acm.org/doi/10.1007/s10994-006-0587-3

Constant-Time Approximation Algorithms for the Knapsack Problem

Autoři: Susumu Kiyoshima Yuichi Yoshida Hiro Ito

Zdroj: Lecture Notes in Computer Science ISBN: 9783642299513

Přístupová URL adresa: https://link.springer.com/chapter/10.1007%2F978-3-642-29952-0_17
https://dblp.uni-trier.de/db/conf/tamc/tamc2012.html#ItoKY12
https://rd.springer.com/chapter/10.1007/978-3-642-29952-0_17

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

Autoři: Yoshida, Yuichi

Témata: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1006.3368

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

Autoři: Shai Ben-David

Zdroj: Lecture Notes in Computer Science ISBN: 9783540222828

Přístupová URL adresa: https://link.springer.com/chapter/10.1007%2F978-3-540-27819-1_29
https://core.ac.uk/display/20685279
https://dblp.uni-trier.de/db/conf/colt/colt2004.html#Ben-David04
https://cs.uwaterloo.ca/~shai/PAPER.pdf
http://cs.uwaterloo.ca/~shai/PAPER.pdf
https://rd.springer.com/chapter/10.1007%2F978-3-540-27819-1_29

Testable Bounded Degree Graph Properties Are Random Order Streamable

Autoři: Monemizadeh, Morteza Muthukrishnan, S. Peng, Pan a další

Přispěvatelé: Monemizadeh, Morteza Muthukrishnan, S. Peng, Pan a další

Témata: FOS: Computer and information sciences, 0102 computer and information sciences, 02 engineering and technology, graph property testing, Graph streaming algorithms, constant-time approximation algorithms, 01 natural sciences, 102031 Theoretische Informatik, Graph property testing, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Constant-time approximation algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1707.07334
https://ucrisportal.univie.ac.at/de/publications/646d2fe2-7982-4707-ae83-96526d4c8829
https://doi.org/10.4230/LIPIcs.ICALP.2017.131
https://drops.dagstuhl.de/opus/volltexte/2017/7478/pdf/LIPIcs-ICALP-2017-131.pdf/
https://nyuscholars.nyu.edu/en/publications/testable-bounded-degree-graph-properties-are-random-order-streama
https://eprints.whiterose.ac.uk/148804/
https://doi.org/10.4230/LIPIcs.ICALP.2017.131
https://drops.dagstuhl.de/opus/volltexte/2017/7478/
https://arxiv.org/abs/1707.07334
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.131

IMPROVED CONSTANT-TIME APPROXIMATION ALGORITHMS FOR MAXIMUM MATCHINGS AND OTHER OPTIMIZATION PROBLEMS.

Autoři: Yoshida, Yuichi Yamamoto, Masaki Ito, Hiro

Zdroj: SIAM Journal on Computing; 2012, Vol. 41 Issue 4, p1074-1093, 20p

Témata: ALGORITHMS, APPROXIMATION theory, GRAPH theory, ERRORS, QUERYING (Computer science)

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

Autoři: Kusumoto, Mitsuru Yoshida, Yuichi Ito, Hiro

Zdroj: 2012 Third International Conference on Networking & Computing; 1/ 1/2012, p407-413, 7p

Constant-Time Approximation Algorithms for the Knapsack Problem.

Autoři: Ito, Hiro Kiyoshima, Susumu Yoshida, Yuichi

Zdroj: Theory & Applications of Models of Computation (9783642299513); 2012, p131-142, 12p

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

Autoři: Yoshida, Yuichi

Zdroj: Proceedings of the 43rd Annual ACM Symposium: Theory of Computing; 6/ 6/2011, p665-674, 10p

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

Autoři: Shai Ben-David

Zdroj: Machine Learning; Mar2007, Vol. 66 Issue 2-3, p243-257, 15p

Témata: ALGORITHMS, CLUSTER analysis (Statistics), COMBINATORIAL optimization, DISTRIBUTION (Probability theory)

Constant-Time Approximation Algorithms via Local Improvements.

Autoři: Nguyen, H.N. Onak, K.

Zdroj: 2008 49th Annual IEEE Symposium on Foundations of Computer Science; 2008, p327-336, 10p

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.

Autoři: Bhattacharya, Sayan Kiss, Peter Saranurak, Thatchaphol a další

Zdroj: Journal of the ACM; Oct2024, Vol. 71 Issue 5, p1-32, 32p

Témata: GRAPH algorithms, OPEN-ended questions, ALGORITHMS

Exponentially Faster Massively Parallel Maximal Matching.

Autoři: BEHNEZHAD, SOHEIL HAJIAGHAYI, MOHAMMADTAGHI HARRIS, DAVID G.

Zdroj: Journal of the ACM; Oct2023, Vol. 70 Issue 5, p1-18, 18p

Témata: RANDOM graphs, DISTRIBUTED computing, PARALLEL programming, GRAPH algorithms, APPROXIMATION algorithms

Greedy maximal independent sets via local limits.

Autoři: Krivelevich, Michael Mészáros, Tamás Michaeli, Peleg a další

Zdroj: Random Structures & Algorithms; Jul2024, Vol. 64 Issue 4, p986-1015, 30p

Témata: INDEPENDENT sets, RANDOM graphs, GREEDY algorithms, PLANAR graphs, TREE graphs

Estimating Graph Parameters from Random Order Streams

Autoři: Peng, Pan Sohler, Christian

Témata: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1711.04881

SUBLINEAR TIME APPROXIMATION OF THE COST OF A METRIC k -NEAREST NEIGHBOR GRAPH.

Autoři: CZUMAJ, ARTUR SOHLER, CHRISTIAN

Zdroj: SIAM Journal on Computing; 2024, Vol. 53 Issue 2, p524-571, 48p

Témata: METRIC spaces, DIRECTED graphs, K-nearest neighbor classification, SPANNING trees, COST estimates, COST