Výsledky vyhledávání - "randomized and approximation algorithms"

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 01231)

Autoři: Martin Dyer and Mark Jerrum and Marek Karpinski Dyer, Martin Jerrum, Mark a další

Témata: Data processing Computer science, InProceedings, publishedVersion

Randomized stochastic approximation algorithms

Autoři: Konstantin Amelin Oleg Granichin Olga Granichina

Zdroj: 2014 European Control Conference (ECC). :2827-2832

Témata: 0209 industrial biotechnology, 0203 mechanical engineering, 02 engineering and technology

Přístupová URL adresa: https://ieeexplore.ieee.org/document/6862625/

SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS

Autoři: Keqin Li

Zdroj: Parallel Algorithms and Applications. 10:271-281

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/paapp/paapp10.html#Li97
https://www.tandfonline.com/doi/abs/10.1080/10637199708915622

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)

Autoři: Martin Dyer and Uriel Feige and Alan M. Frieze and Marek Karpinski Dyer, Martin Feige, Uriel a další

Témata: Randomized Algorithms, Approximation Algorithms, Probabilistically Checkable Proofs, Approximation Hardness, Optimization Problems, Counting Problems, Streaming Algorithms, Random Graphs, Hypergraphs, Probabilistic Method, Networks, Linear Programs, Semidefinite Programs, Data processing Computer science, InProceedings, publishedVersion

08201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms

Autoři: Dyer, Martin E. Jerrum, Mark Karpinski, Marek a další

Přispěvatelé: Dyer, Martin E. Jerrum, Mark Karpinski, Marek a další

Témata: Internet, Network Design, Optimization Problems, Approximation Complexity, Measurement Problems, Algorithmic Game Theory, Randomized Algorithms, ddc:004, Approximation Algorithms, Decentralized Networks

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08201.1

05201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms

Autoři: Dyer, Martin Jerrum, Mark Karpinski, Marek a další

Přispěvatelé: Dyer, Martin Jerrum, Mark Karpinski, Marek a další

Témata: Optimization Problems, Measurement Problems, Randomized Algorithms, ddc:004, Approximation Algorithms, Decentralized Networks

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05201.1

Randomized and Approximation Algorithms for Blue-Red Matching

Autoři: Nomikos, C. Pagourtzis, A. Zachos, S.

Zdroj: Lecture Notes in Computer Science ISBN: 9783540744559

Přístupová URL adresa: http://olympias.lib.uoi.gr/jspui/handle/123456789/26680

design and analysis of randomized and approximation algorithms dagstuhl seminar 11241

Autoři: Dyer, Martin Feige, Uriel Frieze, Alan M. a další

Přispěvatelé: Dyer, Martin Feige, Uriel Frieze, Alan M. a další

Témata: Counting Problems, Optimization Problems, Linear Programs, Randomized Algorithms, Approximation Hardness, Streaming Algorithms, Hypergraphs, Semidefinite Programs, Probabilistic Method, Random Graphs, ddc:004, Networks, Approximation Algorithms, Probabilistically Checkable Proofs

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.6.24

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 01231)

Autoři: Dyer, Martin Jerrum, Mark Karpinski, Marek a další

Přispěvatelé: Dyer, Martin Jerrum, Mark Karpinski, Marek a další

Témata: ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2021/15193/
https://drops.dagstuhl.de/opus/volltexte/2021/15193/pdf/DagSemRep-309.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.309

Design and analysis of randomized and approximation algorithms :05201 abstracts collection ; Dagstuhl seminar

Přispěvatelé: Dyer, Martin Jerrum, Mark Karpinski, Marek

Dostupnost: http://data.europeana.eu/aggregation/europeana/2048441/item_BQQPLAMXY2RXH7VPTDP2T6G2ADLRA5G4
http://data.europeana.eu/item/2048441/item_BQQPLAMXY2RXH7VPTDP2T6G2ADLRA5G4

Randomized and Approximation Algorithms for Blue-Red Matching.

Autoři: Hutchison, David Kanade, Takeo Kittler, Josef a další

Zdroj: Mathematical Foundations of Computer Science 2007; 2007, p715-725, 11p

SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS.

Autoři: LI, KEQIN

Zdroj: Parallel Algorithms & Applications; Jan1997, Vol. 10 Issue 3/4, p271-281, 11p

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.

Autoři: Kisfaludi-Bak, Sándor Nederlof, Jesper Węgrzycki, Karol

Zdroj: Journal of the ACM; Dec2025, Vol. 72 Issue 6, p1-48, 48p

Témata: TRAVELING salesman problem, TIME complexity, ALGORITHMS, COMPUTATIONAL complexity, APPROXIMATION theory

Parameterized Approximation Scheme for Feedback Vertex Set

Autoři: Jana, Satyabrata Lokshtanov, Daniel Mandal, Soumen a další

Témata: Feedback Vertex Set, Parameterized Approximation, Data processing Computer science, InProceedings, publishedVersion

URL: https://drops.dagstuhl.de/opus/volltexte/2023/18590/

A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback

Autoři: Nie, Guanyu Nadew, Yididiya Y Zhu, Yanhui a další

Témata: Computer Science - Machine Learning, Computer Science - Artificial Intelligence, Computer Science - Data Structures and Algorithms, Electrical Engineering and Systems Science - Systems and Control, text

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

Toward a Better Understanding of Randomized Greedy Matching.

Autoři: ZHIHAO GAVIN TANG XIAOWEI WU YUHAO ZHANG

Zdroj: Journal of the ACM; Dec2023, Vol. 70 Issue 6, p1-32, 32p

Témata: BIPARTITE graphs, APPROXIMATION algorithms, GREEDY algorithms, POLYNOMIAL time algorithms, ONLINE algorithms, GRAPH theory

On String Matching with Mismatches.

Autoři: Nicolae, Marius Rajasekaran, Sanguthevar

Zdroj: Algorithms; 2015, Vol. 8 Issue 2, p248-270, 23p

Témata: PATTERN matching, ALGORITHMS, HAMMING distance, PATTERNS (Mathematics)

Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces.

Autoři: Allan Borodin Rafail Ostrovsky Yuval Rabani

Zdroj: Machine Learning; Jul2004, Vol. 56 Issue 1-3, p153-167, 15p

Cover and hitting times of hyperbolic random graphs.

Autoři: Kiwi, Marcos Schepers, Markus Sylvester, John

Zdroj: Random Structures & Algorithms; Dec2024, Vol. 65 Issue 4, p915-978, 64p

Témata: RANDOM walks, ENERGY consumption, EXPONENTS

Discrete quantum walks on the symmetric group.

Autoři: Banerjee, Avah

Zdroj: Quantum Studies: Mathematics & Foundations; Oct2024, Vol. 11 Issue 3, p477-490, 14p