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

BOREL ORACLES. AN ANALYTICAL APPROACH TO CONSTANT-TIME ALGORITHMS

Autoři: ELEK, GÁBOR LIPPNER, GÁBOR

Zdroj: Proceedings of the American Mathematical Society, 2010 Aug 01. 138(8), 2939-2947.

Přístupová URL adresa: https://www.jstor.org/stable/20764247

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/

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

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/

An improved constant-time approximation algorithm for maximum~matchings

Autoři: Masaki Yamamoto Yuichi Yoshida Hiro Ito

Zdroj: Proceedings of the forty-first annual ACM symposium on Theory of computing. :225-234

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

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/stoc/stoc2009.html#YoshidaYI09
https://doi.org/10.1145/1536414.1536447
https://dl.acm.org/doi/10.1145/1536414.1536447

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 Local Computation Algorithms

Autoři: Boaz Patt-Shamir Shai Vardi Yishay Mansour

Zdroj: Lecture Notes in Computer Science ISBN: 9783319286839

Témata: Sublinear algorithms, 0202 electrical engineering, electronic engineering, information engineering, Local computation algorithms, 0102 computer and information sciences, 02 engineering and technology, Maximal weight forest, 01 natural sciences, Approximation algorithms

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/waoa/waoa2015.html#MansourPV15
https://rd.springer.com/chapter/10.1007/978-3-319-28684-6_10
https://link.springer.com/chapter/10.1007%2F978-3-319-28684-6_10
https://link.springer.com/chapter/10.1007/978-3-319-28684-6_10/fulltext.html
https://link.springer.com/article/10.1007/s00224-017-9788-3
https://dblp.uni-trier.de/db/journals/mst/mst62.html#MansourPV18
https://doi.org/10.1007/s00224-017-9788-3

Efficient polynomial-time approximation scheme for the genus of dense graphs.

Autoři: Jing, Yifan Mohar, Bojan

Zdroj: Journal of the ACM; Dec2024, Vol. 71 Issue 6, p1-33, 33p

Témata: TOPOLOGICAL graph theory, GRAPH algorithms, APPROXIMATION algorithms, DENSE graphs, SUBGRAPHS, TRIANGLES

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

Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems.

Autoři: Helfrich, Stephan Ruzika, Stefan Thielen, Clemens

Zdroj: INFORMS Journal on Computing; Sep/Oct2025, Vol. 37 Issue 5, p1223-1241, 19p

Témata: MULTI-objective optimization, CONVEX sets, KNAPSACK problems, APPROXIMATION error, POLYNOMIAL time algorithms, ALGORITHMS, COMBINATORIAL optimization

Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput.

Autoři: Schieber, Baruch Samineni, Bhargav Vahidi, Soroush

Zdroj: Algorithmica; Oct2025, Vol. 87 Issue 10, p1453-1473, 21p

Témata: ENERGY harvesting, SCHEDULING, RESOURCE allocation, APPROXIMATION algorithms, POLYNOMIAL time algorithms

Improved Product-State Approximation Algorithms for Quantum Local Hamiltonians

Autoři: Thiago Bergamaschi Bergamaschi, Thiago

Témata: Approximation Algorithms, Quantum Information, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.20
Is Part Of LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)

Fully Polynomial Time Approximation Schemes for Robust Multistage Decision Making.

Autoři: Halman, Nir Nannicini, Giacomo

Zdroj: INFORMS Journal on Computing; Sep/Oct2025, Vol. 37 Issue 5, p1306-1327, 22p

Témata: OPERATIONS research, KNAPSACK problems, DYNAMIC programming, INVENTORY control, DECISION making, APPROXIMATION algorithms

Constant-time distributed dominating set approximation

Autoři: Kuhn, Fabian Wattenhofer, Roger

Zdroj: Technical Report / Department of Computer Science, ETH Zurich, 392
Distributed Computing, 17 (4)

Témata: Dominating set, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, LP-Relaxation, Approximation algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis souboru: application/application/pdf

Přístupová URL adresa: https://www.research-collection.ethz.ch/bitstream/20.500.11850/32917/2/446_2004_Article_112.pdf
https://www.research-collection.ethz.ch/handle/20.500.11850/71722
http://theory.csail.mit.edu/classes/6.885/spring06/papers/KuhnWattenhofer.pdf
https://www.disco.ethz.ch/publications/distcomp05.pdf
https://www.cs.iastate.edu/~chaudhur/cs611/Sp07/reading/KuhnWattenhofer.pdf
http://distcomp.ethz.ch/publications/distcomp05.pdf
https://core.ac.uk/display/20674261
https://link.springer.com/article/10.1007/s00446-004-0112-5
http://hdl.handle.net/20.500.11850/71722
http://hdl.handle.net/20.500.11850/32917
http://doc.rero.ch/record/318691/files/446_2004_Article_112.pdf

A Local 6-Approximation Distributed Algorithm for Minimum Dominating Set Problem in Planar Triangle-Free Graphs.

Autoři: Wawrzyniak, Wojciech

Zdroj: Algorithms; May2025, Vol. 18 Issue 5, p280, 16p

Témata: APPROXIMATION algorithms, GRAPH theory, GRAPH algorithms, DOMINATING set, PLANAR graphs, DISTRIBUTED algorithms

Reverse Maximum Inner Product Search: Formulation, Algorithms, and Analysis.

Autoři: DAICHI AMAGATA TAKAHIRO HARA

Zdroj: ACM Transactions on the Web; Nov2023, Vol. 17 Issue 4, p1-23, 23p

Témata: APPROXIMATION algorithms, RESEARCH questions, ALGORITHMS

An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length.

Autoři: Shin, Donghoon Choi, Sunghee

Zdroj: PLoS ONE. 11/21/2023, Vol. 18 Issue 11, p1-18. 18p.

Témata: *APPROXIMATION algorithms, *SPANNING trees, *DETERMINISTIC algorithms, *VORONOI polygons, *ALGORITHMS, *VERY large scale circuit integration