Výsledky vyhľadávania - randomized and approximation algorithms

Randomized approximation algorithms for monotone k-submodular function maximization with constraints

Autori: Yuying Li Min Li Yang Zhou a ďalší

Zdroj: Journal of Combinatorial Optimization. 49

Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private

Autori: Tětek, Jakub Jakub Tětek

Prispievatelia: Tětek, Jakub Jakub Tětek

Predmety: FOS: Computer and information sciences, Randomized approximation algorithms, Differential privacy, 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, ddc:004, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2211.03695
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.73

Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private

Autori: Tětek, Jakub Jakub Tětek

Prispievatelia: Tětek, Jakub Jakub Tětek

Predmety: Differential privacy, Randomized approximation algorithms

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.73

Dostupnosť: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.73
https://nbn-resolving.org/urn:nbn:de:0030-drops-210660
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.73

Formalization of Randomized Approximation Algorithms for Frequency Moments

Autori: Karayel, Emin Emin Karayel

Prispievatelia: Karayel, Emin Emin Karayel

Predmety: Randomized Algorithms, ddc:004, Isabelle/HOL, Formal Verification, Frequency Moments

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2022.21

Formalization of Randomized Approximation Algorithms for Frequency Moments

Autori: Emin Karayel Karayel, Emin

Témy: Formal Verification, Isabelle/HOL, Randomized Algorithms, Frequency Moments, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2022.21
Is Part Of LIPIcs, Volume 237, 13th International Conference on Interactive Theorem Proving (ITP 2022)

Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks

Autori: Bhaskar DasGupta Piotr Berman Eduardo D. Sontag

Zdroj: Lecture Notes in Computer Science ISBN: 9783540228943

Predmety: Randomized approximation algorithms, Biological networks, Applied Mathematics, Set multicover, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, 0102 computer and information sciences, 02 engineering and technology, Reverse engineering, 01 natural sciences

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0166218X06003659
https://www.cs.uic.edu/~dasgupta/resume/publ/papers/multicover.pdf
https://pennstate.pure.elsevier.com/en/publications/randomized-approximation-algorithms-for-set-multicover-problems-w
https://doi.org/10.1016/j.dam.2004.11.009
https://www.mit.edu/~esontag/FTP_DIR/04approx_dasgupta_berman_set_cover.pdf
https://rd.springer.com/chapter/10.1007/978-3-540-27821-4_4

Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

Autori: Baveja, Alok Srinivasan, Aravind

Zdroj: Mathematics of Operations Research, 2000 May 01. 25(2), 255-280.

Prístupová URL adresa: https://www.jstor.org/stable/3690581

On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings

Autori: Kijima, Shuji Nemoto, Toshio

Zdroj: Mathematics of Operations Research, 2012 May 01. 37(2), 356-371.

Prístupová URL adresa: http://dx.doi.org/10.1287/moor.1110.0526

Randomized approximation algorithms for planar visibility counting problem

Autori: Mohammad Ghodsi Sharareh Alipour Amir Jafari

Zdroj: Theoretical Computer Science. 707:46-55

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0304397517307375
https://dblp.uni-trier.de/db/journals/tcs/tcs707.html#AlipourGJ18

Randomized approximation algorithms for monotone k-submodular function maximization with constraints.

Autori: Li, Yuying Li, Min Zhou, Yang a ďalší

Zdroj: Journal of Combinatorial Optimization; May2025, Vol. 49 Issue 4, p1-28, 28p

A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem

Autori: Karger, David R.

Zdroj: SIAM Review, 2001 Sep 01. 43(3), 499-522.

Prístupová URL adresa: https://www.jstor.org/stable/3649796

Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm

Autori: Proença, Nathan Benedetto Silva, Marcel K. de Carli Sato, Cristiane M. a ďalší

Témy: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, Mathematics - Optimization and Control, text

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

Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams

Autori: Paweł Gawrychowski Oleg Merkurev Arseny M. Shur a ďalší

Prispievatelia: Paweł Gawrychowski Oleg Merkurev Arseny M. Shur a ďalší

Zdroj: Algorithmica, 81 (9)
Leibniz International Proceedings in Informatics (LIPIcs), 54
27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)
Algorithmica

Predmety: FOS: Computer and information sciences, ADDITIVES, streaming algorithms, Lower bound, Space lower bounds, MONTE CARLO ALGORITHMS, ERRORS, real-time algorithms, PALINDROME, Streaming, LOWER BOUNDS, REAL-TIME ALGORITHM, Real-time algorithm, LINGUISTICS, MONTE-CARLO APPROXIMATIONS, Computer Science - Data Structures and Algorithms, Palindrome, ACOUSTIC STREAMING, Data Structures and Algorithms (cs.DS), Palindromes, palin- dromes, Monte Carlo algorithms, REAL TIME ALGORITHMS, STREAMING, Streaming algorithms, MONTE CARLO METHODS, Real-time algorithms, LOWER BOUND, RANDOMIZED APPROXIMATION, MULTIPLICATIVE ERRORS, APPROXIMATION ALGORITHMS, space lower bounds, ddc:004, TIME AND SPACE COMPLEXITY

Popis súboru: application/pdf; application/application/pdf

Prístupová URL adresa: https://link.springer.com/content/pdf/10.1007/s00453-019-00591-8.pdf
http://arxiv.org/abs/1610.03125
https://science.urfu.ru/en/publications/tight-tradeoffs-for-real-time-approximation-of-longest-palindrome-2
https://arxiv.org/abs/1610.03125
https://doi.org/10.1007/s00453-019-00591-8
https://link.springer.com/article/10.1007/s00453-019-00591-8
https://dblp.uni-trier.de/db/journals/corr/corr1610.html#GawrychowskiMSU16
https://link.springer.com/content/pdf/10.1007/s00453-019-00591-8.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.18
http://hdl.handle.net/20.500.11850/363191
http://hdl.handle.net/20.500.11850/114560
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85067244127&doi=10.1007/s00453-019-00591-8&partnerID=40&md5=08c55272190498c12327dca98bbffee5
http://elar.urfu.ru/handle/10995/117868

Approximation algorithms for maximum cut with limited unbalance

Autori: GALBIATI, GIULIA Francesco Maffioli Galbiati, Giulia a ďalší

Prispievatelia: GALBIATI, GIULIA Francesco Maffioli Galbiati, Giulia a ďalší

Zdroj: Theoretical Computer Science. 385:78-87

Predmety: SEMIDEFINITE PROGRAMMING, MAXIMUM CUT, General Computer Science, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, AUT, RANDOMIZED APPROXIMATION ALGORITHM, Randomized approximation algorithm, Maximum cut, Semidefinite programming, Limited unbalance cut, Computer Science(all)

Popis súboru: STAMPA

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/tcs/tcs385.html#GalbiatiM07
https://dl.acm.org/citation.cfm?id=1290255
https://core.ac.uk/display/82092729
https://www.sciencedirect.com/science/article/pii/S0304397507004732
https://dlnext.acm.org/doi/10.1016/j.tcs.2007.05.036
https://dl.acm.org/doi/10.1016/j.tcs.2007.05.036
https://www.openaccessrepository.it/record/162326
https://hdl.handle.net/11311/552387

Randomized priority algorithms

Autori: Angelopoulos, Spyros Borodin, Allan

Prispievatelia: Angelopoulos, Spyros Borodin, Allan

Zdroj: Theoretical Computer Science. 411:2542-2558

Predmety: Randomized approximation algorithms, 0211 other engineering and technologies, Facility location, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Makespan scheduling, 01 natural sciences, Greedy algorithms, Theoretical Computer Science, Computer Science(all)

Prístupová URL adresa: https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1323903
https://core.ac.uk/display/81131835
https://doi.org/10.1016/j.tcs.2010.03.014
https://dblp.uni-trier.de/db/journals/tcs/tcs411.html#AngelopoulosB10
https://www.mpi-inf.mpg.de/~sangelop/Papers/randomized.pdf
http://pubman.mpdl.mpg.de/pubman/item/escidoc:1323903
https://hal.science/hal-02986727v1
https://doi.org/10.1016/j.tcs.2010.03.014

Lectures on approximation and randomized algorithms : proceedings of the Berlin - Poznań Summer School / ed. by Michał Karoński, Hans-Jürgen Prömel.

Prispievatelia: Karoński, Michał. Prömel, Hans Jürgen. Wydawnictwo Naukowe PWN. pbl a ďalší

Zdroj: Bibliogr. s. 68-71, 153-155.

Predmety: Aproksymacja numeryczna -- konferencje, Aproksymacja stochastyczna -- konferencje, Grafy losowe -- konferencje, Algorytmy -- konferencje

Prístupová URL adresa: http://katalog.nukat.edu.pl/lib/item?id=chamo:163877&theme=nukat

Randomized Approximation Algorithms for Query Optimization Problems on Two Processors

Autori: R. Ravi Ojas Parekh Eduardo Sany Laber

Zdroj: Lecture Notes in Computer Science ISBN: 9783540441809

Predmety: 150399 Business and Management not elsewhere classified, FOS: Economics and business

Prístupová URL adresa: http://www.contrib.andrew.cmu.edu/%7Eravi/mbc.pdf
http://repository.cmu.edu/tepper/393/
http://www.mathcs.emory.edu/~ojas/papers/queryopt.pdf
https://rd.springer.com/chapter/10.1007/3-540-45749-6_57
https://core.ac.uk/display/24654741
http://repository.cmu.edu/cgi/viewcontent.cgi?article=1399&context=tepper
https://link.springer.com/chapter/10.1007%2F3-540-45749-6_57

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Autori: Michel X. Goemans David P. Williamson

Zdroj: Journal of the ACM. 42:1115-1145

Predmety: Combinatorial optimization, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, randomized approximation algorithms, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Approximation methods and heuristics in mathematical programming, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://dl.acm.org/doi/10.1145/227683.227684
http://convexoptimization.com/TOOLS/maxcut-jacm.pdf
https://doi.org/10.1145/227683.227684
https://math.mit.edu/~goemans/PAPERS/maxcut-jacm.pdf
http://www-math.mit.edu/~goemans/PAPERS/maxcut-jacm.pdf
http://alex.smola.org/journalclub/GoeWil95.pdf

Some new randomized approximation algorithms

Autori: Andersson, Gunnar

Zdroj: Trita-NA.

Popis súboru: electronic

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-2971
https://kth.diva-portal.org/smash/get/diva2:8713/FULLTEXT01.pdf

Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks

Autori: Piotr Berman Bhaskar Dasgupta Eduardo Sontag a ďalší

Prispievatelia: Piotr Berman Bhaskar Dasgupta Eduardo Sontag a ďalší

Zdroj: http://www.math.rutgers.edu/~sontag/FTP_DIR/dasgupta-berman-sontag-setcover-journal-final.pdf.

Predmety: Set multicover, randomized approximation algorithms, reverse engineering, biological

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.3602

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.3602
http://www.math.rutgers.edu/~sontag/FTP_DIR/dasgupta-berman-sontag-setcover-journal-final.pdf