Search Results - Randomised and approximation algorithms*

Randomized Algorithms for the Low-Rank Approximation of Matrices

Authors: Liberty, Edo Woolfe, Franco Martinsson, Per-Gunnar et al.

Source: Proceedings of the National Academy of Sciences of the United States of America, 2007 Dec . 104(51), 20167-20172.

Access URL: https://www.jstor.org/stable/25450863

The Power of Standard Information for Multivariate Approximation in the Randomized Setting

Authors: Wasilkowski, G. W. Woźniakowski, H.

Source: Mathematics of Computation, 2007 Apr 01. 76(258), 965-988.

Access URL: https://www.jstor.org/stable/40234412

Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

Authors: Baveja, Alok Srinivasan, Aravind

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

Access URL: https://www.jstor.org/stable/3690581

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

Authors: Kijima, Shuji Nemoto, Toshio

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

Access URL: http://dx.doi.org/10.1287/moor.1110.0526

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

Authors: Karger, David R.

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

Access URL: https://www.jstor.org/stable/3649796

Convergence Analysis of Randomized Block Lanczos Algorithms for Low-Rank Matrix Approximations

Authors: Yuan, Qiaochu

Subject Terms: Applied mathematics

File Description: application/pdf

Access URL: https://escholarship.org/uc/item/8zn1d6hv
https://escholarship.org/content/qt8zn1d6hv/qt8zn1d6hv.pdf

A randomised approximation algorithm for the hitting set problem

Authors: El Ouali, Mourad Fohlin, Helena Srivastav, Anand

Source: Theoretical Computer Science. 555:23-34

Subject Terms: Approximation algorithms, Probabilistic methods, Randomised rounding, Hitting set, Vertex cover, Greedy algorithms

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-112302

Randomized Neural Networks Based Decentralized Multi-Task Learning via Hybrid Multi-Block ADMM

Authors: Ye, Yu Xiao, Ming Skoglund, Mikael

Source: IEEE Transactions on Signal Processing. 69:2844-2857

Subject Terms: Task analysis, Convex functions, Training, Neural networks, Approximation algorithms, Signal processing algorithms, Load modeling, Multi-task learning, randomized feed-forward neural networks, decentralized optimization

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-298637
https://kth.diva-portal.org/smash/get/diva2:1579735/FULLTEXT01.pdf

Provable randomized rounding for minimum-similarity diversification

Authors: Ordozgoiti, B. Mahadevan, A. Matakos, A. et al.

Source: Data mining and knowledge discovery. 36(2):709-738

Subject Terms: Diversification, Quadratic programming, Randomized rounding, Recommender systems, Approximation algorithms, Combinatorial optimization, Cardinality constraints, Data collection, Distance functions, Item relatedness, Minimisation, Penalty term, Searching for informations, Similarity functions

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-319160
https://doi.org/10.1007/s10618-021-00811-2

Surrogate Modeling of Resonant Behavior in Scattering Problems Through Adaptive Rational Approximation and Sketching

Authors: Pradovera, Davide Hiptmair, Ralf Perugia, Ilaria

Source: Journal of Scientific Computing. 104(3)

Subject Terms: Boundary element method, Frequency-domain modeling, Randomized sketching, Rational approximation, Resonance, Scattering problems

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-246667
https://doi.org/10.1007/s10915-025-03020-x

Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence

Authors: Femke van Ieperen Ivan Kryven

Source: Ann Comb

Subject Terms: Randomised approximation algorithms, Original Paper, 05C80, 05C20, 0102 computer and information sciences, 68W20, 0101 mathematics, 01 natural sciences, 68W25, Directed graphs, Random graphs

New Tools and Connections for Exponential-Time Approximation

Authors: Bansal, Nikhil Chalermsook, Parinya Laekhanukit, Bundit et al.

Source: Algorithmica. 81(10):3993-4009

Subject Terms: Approximation algorithms, PCP's, Exponential time algorithms

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-259411
https://doi.org/10.1007/s00453-018-0512-8

A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs: A randomised approximation algorithm for counting the number of forests in dense graphs

Authors: J. D. Annan

Source: Combinatorics, Probability and Computing. 3:273-283

Subject Terms: dense graph, Combinatorial probability, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, 0102 computer and information sciences, counting the number of forests, 15. Life on land, Enumeration in graph theory, randomised approximation algorithm, 01 natural sciences, Trees, randomised approximation scheme

File Description: application/xml

Access URL: https://zbmath.org/690966
https://doi.org/10.1017/s0963548300001188
https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/randomised-approximation-algorithm-for-counting-the-number-of-forests-in-dense-graphs/E61A9E98F5191D737931284AE81DF047
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0963548300001188
https://dblp.uni-trier.de/db/journals/cpc/cpc3.html#Annan94

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

Contributors: Karoński, Michał. Prömel, Hans Jürgen. Wydawnictwo Naukowe PWN. pbl et al.

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

Subject Terms: Aproksymacja numeryczna -- konferencje, Aproksymacja stochastyczna -- konferencje, Grafy losowe -- konferencje, Algorytmy -- konferencje

Access URL: http://katalog.nukat.edu.pl/lib/item?id=chamo:163877&theme=nukat

Some new randomized approximation algorithms

Authors: Andersson, Gunnar

Source: Trita-NA.

File Description: electronic

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

DETERMINISTIC NEAR-OPTIMAL APPROXIMATION ALGORITHMS FOR DYNAMIC SET COVER

Authors: Bhattacharya, Sayan Henzinger, Monika Na Nongkai, Danupon et al.

Source: SIAM journal on computing (Print). 52(5):1132-1192

Subject Terms: approximation algorithms, dynamic data structure, set cover

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-339706

Mixed Poisson Approximation of Node Depth Distributions in Random Binary Search Trees

Authors: Grübel, Rudolf Stefanoski, Nikolče

Source: The Annals of Applied Probability, 2005 Feb 01. 15(1A), 279-297.

Access URL: https://www.jstor.org/stable/30038316

Improved Combinatorial Approximations for Weighted Correlation Clustering

Authors: Mojtaba Ostovari Alireza Zarei

Source: Discrete Mathematics & Theoretical Computer Science, Vol vol. 27:2, Iss Discrete Algorithms (2025)

Subject Terms: data structures and algorithms, Mathematics, QA1-939

File Description: electronic resource

Relation: http://dmtcs.episciences.org/12424/pdf; https://doaj.org/toc/1365-8050

Access URL: https://doaj.org/article/5a4ece1c464a4763b419779043172ce0

RPEM: Randomized Monte Carlo parametric expectation maximization algorithm.

Authors: Chen, Rong Schumitzky, Alan Kryshchenko, Alona et al.

Source: CPT: Pharmacometrics & Systems Pharmacology; May2024, Vol. 13 Issue 5, p759-780, 22p

Subject Terms: ORDINARY differential equations, STOCHASTIC approximation, EXPECTATION-maximization algorithms, PARAMETERS (Statistics), ALGORITHMS

Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times

Authors: Levi, Retsef Shi, Cong

Source: Operations Research, 2013 May 01. 61(3), 593-602.

Access URL: http://dx.doi.org/10.1287/opre.2013.1162