Výsledky vyhledávání - Randomised AND approximation algorithms

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

Autoři: Ye, Yu Xiao, Ming Skoglund, Mikael

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

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

Popis souboru: electronic

Přístupová URL adresa: 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

Autoři: Ordozgoiti, B. Mahadevan, A. Matakos, A. a další

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

Témata: 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

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-319160
https://doi.org/10.1007/s10618-021-00811-2

A randomised approximation algorithm for the hitting set problem

Autoři: El Ouali, Mourad Fohlin, Helena Srivastav, Anand

Zdroj: Theoretical Computer Science. 555:23-34

Témata: Approximation algorithms, Probabilistic methods, Randomised rounding, Hitting set, Vertex cover, Greedy algorithms

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-112302

Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

Autoři: Baveja, Alok Srinivasan, Aravind

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

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

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

Autoři: Karger, David R.

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

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

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

Autoři: Femke van Ieperen Ivan Kryven

Zdroj: Ann Comb

Témata: 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

Autoři: Bansal, Nikhil Chalermsook, Parinya Laekhanukit, Bundit a další

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

Témata: Approximation algorithms, PCP's, Exponential time algorithms

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-259411
https://doi.org/10.1007/s00453-018-0512-8

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

Přispěvatelé: Karoński, Michał. Prömel, Hans Jürgen. Wydawnictwo Naukowe PWN. pbl a další

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

Témata: Aproksymacja numeryczna -- konferencje, Aproksymacja stochastyczna -- konferencje, Grafy losowe -- konferencje, Algorytmy -- konferencje

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

Improved Combinatorial Approximations for Weighted Correlation Clustering

Autoři: Mojtaba Ostovari Alireza Zarei

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

Témata: data structures and algorithms, Mathematics, QA1-939

Popis souboru: electronic resource

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

Přístupová URL adresa: https://doaj.org/article/5a4ece1c464a4763b419779043172ce0

Some new randomized approximation algorithms

Autoři: Andersson, Gunnar

Zdroj: Trita-NA.

Popis souboru: electronic

Pří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

DETERMINISTIC NEAR-OPTIMAL APPROXIMATION ALGORITHMS FOR DYNAMIC SET COVER

Autoři: Bhattacharya, Sayan Henzinger, Monika Na Nongkai, Danupon a další

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

Témata: approximation algorithms, dynamic data structure, set cover

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-339706

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

Autoři: Levi, Retsef Shi, Cong

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

Přístupová URL adresa: http://dx.doi.org/10.1287/opre.2013.1162

On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions From Limited Samples

Autoři: Ben Adcock, Simone Brugiapaglia, Nick Dexter, Sebastian Moraga

Resource Type: eBook.

Témata: Characteristic functions, Approximation theory, Polynomials

Categories: SCIENCE / Physics / Mathematical & Computational

Novel Bounds for Incremental Hessian Estimation With Application to Zeroth-Order Federated Learning

Autoři: Maritan, Alessio Schenato, Luca Dey, Subhrakanti

Zdroj: IEEE Open Journal of Control Systems. 3:173-189

Témata: Optimization, Approximation algorithms, Federated learning, Closed box, Servers, Finite difference methods, Linear programming, Data privacy, estimation

Popis souboru: electronic

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-540663
https://doi.org/10.1109/OJCSYS.2024.3388374

An approximation algorithm for the Euclidean incremental median problem.

Autoři: Shenmaier, Vladimir¹ shenmaier@mail.ru

Zdroj: Discrete Optimization. Nov2016 Part B, Vol. 22, p312-327. 16p.

Témata: Approximation algorithms, Mathematical optimization, Euclidean domains, Euclidean metric, Randomized response technique

Randomized Approximation and Online Algorithms for Assignment Problems

Autoři: Bender, Marco

Thesis Advisors: Westphal, Stephan Prof. Dr.

Témata: 510, Combinatorial Optimization, Approximation Algorithms, Generalized Assignment Problem, Online Optimization, Competitive Analysis, Mathematics (PPN61756535X)

Dostupnost: http://hdl.handle.net/11858/00-1735-0000-0022-6016-2

Nonlinear Formations and Improved Randomized Approximation Algorithms for Multiway and Multicut Problems

Autoři: Bertsimas, Dimitris J. Teo, Chungpiaw Vohra, Rakesh

Popis souboru: 1318398 bytes; application/pdf

Relation: Operations Research Center Working Paper ; OR 308-95

Dostupnost: http://hdl.handle.net/1721.1/5394

An improved approximation algorithm for Hypergraph Max [formula omitted]-Section.

Autoři: Li, Guangfeng Sun, Jian Gao, Jiaquan a další

Zdroj: Discrete Applied Mathematics. Dec2025, Vol. 377, p102-112. 11p.

Témata: *APPROXIMATION algorithms, *SEMIDEFINITE programming, *HYPERGRAPHS, *PERTURBATION theory, *APPROXIMATION error, *DETERMINISTIC algorithms

Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle.

Autoři: Deligkas, Argyrios Mertzios, George B. Spirakis, Paul G. a další

Zdroj: Algorithmica. Sep2024, Vol. 86 Issue 9, p2766-2785. 20p.

Témata: *HAMILTONIAN graph theory, *DETERMINISTIC algorithms, *ALGORITHMS, *APPROXIMATION algorithms

A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond

Autoři: Chuzhoy, J. Gao, Y. Li, J. a další

Zdroj: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. :1158-1167

Témata: balanced cuts, deterministic algorithms, dynamic connectivity, Laplacian solvers, maximum flow, Approximation algorithms, Flow graphs, Dynamic graph algorithms, Linear-time approximation, Minimizing the number of, Minimum spanning forests, Randomized Algorithms, Time complexity, Undirected graph, Graph algorithms

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-292665