Výsledky vyhľadávania - Theory of computation → Approximation algorithms analysis phrases Maximum weight matching*

Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Autori: Chien-Chung Huang François Sellier Huang, Chien-Chung

Prispievatelia: Chien-Chung Huang François Sellier Huang, Chien-Chung

Zdroj: Algorithmica. 86:3598-3628

Predmety: FOS: Computer and information sciences, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, sublinear and near linear time algorithms, 0211 other engineering and technologies, 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 2012 ACM Subject Classification Theory of computation → Streaming, matchoid, 01 natural sciences, Computer Science - Data Structures and Algorithms, matroid, Data Structures and Algorithms (cs.DS), streaming, submodular function maximization

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2107.13071
https://hal.science/hal-03982431v1

Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Autori: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) a ďalší

Prispievatelia: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) a ďalší

Zdroj: APPROX/RANDOM ; https://hal.science/hal-03982431 ; APPROX/RANDOM, Aug 2021, Seattle, United States

Predmety: 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, submodular function maximization, streaming, matroid, matchoid, [INFO]Computer Science [cs]

Geografické téma: Seattle, United States

Dostupnosť: https://hal.science/hal-03982431
https://hal.science/hal-03982431v1/document
https://hal.science/hal-03982431v1/file/2107.13071.pdf

DISTRIBUTED LOCAL APPROXIMATION ALGORITHMS FOR MAXIMUM MATCHING IN GRAPHS AND HYPERGRAPHS.

Autori: HARRIS, DAVID G.

Zdroj: SIAM Journal on Computing; 2020, Vol. 49 Issue 4, p711-746, 36p

Predmety: GRAPH algorithms, DETERMINISTIC algorithms, HYPERGRAPHS, DISTRIBUTED computing, APPROXIMATION algorithms

A Convergence of Theories of Mind and Brain.

Autori: Dubé, Chad Malmberg, Kenneth J.

Zdroj: Computational Brain & Behavior; Dec2025, Vol. 8 Issue 4, p649-670, 22p

A Primer on Deep Learning for Causal Inference.

Autori: Koch, Bernard J. Sainburg, Tim Geraldo Bastías, Pablo a ďalší

Zdroj: Sociological Methods & Research; May2025, Vol. 54 Issue 2, p397-447, 51p

Predmety: ARTIFICIAL neural networks, TREATMENT effect heterogeneity, CAUSAL inference, DEEP learning, ALGORITHMS

Combining recurrent neural networks with variational mode decomposition and multifractals to predict rainfall time series.

Autori: Zhou, Hai Schertzer, Daniel Tchiguirinskaia, Ioulia

Zdroj: Hydrology & Earth System Sciences; 2025, Vol. 29 Issue 18, p4437-4455, 19p

Proceedings of the Workshop on Computation: Theory and Practice (WCTP 2024)

Autori: Jaime Caro Shigeki Hagihara Shin-ya Nishizaki a ďalší

Typ zdroja: eBook.

Predmet: Computer science

Kategórie: COMPUTERS / General

Review article: Feature tracing in radio-echo sounding products of terrestrial ice sheets and planetary bodies.

Autori: Moqadam, Hameed Eisen, Olaf

Zdroj: Cryosphere; 2025, Vol. 19 Issue 6, p2159-2196, 38p

Machine Learning-Facilitated Policy Intensity Analysis: A Proposed Procedure and Its Application.

Autori: Xie, Su Xiong, Hang Shang, Linmei a ďalší

Zdroj: Social Indicators Research; Sep2024, Vol. 174 Issue 3, p881-904, 24p

Predmety: POULTRY farming, ANIMAL culture, POLICY analysis, MACHINE learning, ENVIRONMENTAL policy

Proceedings of the Workshop on Computation: Theory and Practice (WCTP 2023)

Autori: Jaime Caro Shigeki Hagihara Shin-ya Nishizaki a ďalší

Typ zdroja: eBook.

Predmet: Computational complexity--Congresses, Computer science--Congresses

Kategórie: COMPUTERS / General

Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights.

Autori: DINITZ, MICHAEL KORTSARZ, GUY NUTOV, ZEEV

Zdroj: ACM Transactions on Algorithms; Mar2017, Vol. 13 Issue 3, p1-16, 16p

Predmety: APPROXIMATION algorithms, GRAPH algorithms, SUBGRAPHS, WEIGHTED graphs, MATHEMATICAL bounds

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

Autori: Jing, Yifan Mohar, Bojan

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

Predmety: TOPOLOGICAL graph theory, GRAPH algorithms, APPROXIMATION algorithms, DENSE graphs, SUBGRAPHS, TRIANGLES

Toward a Better Understanding of Randomized Greedy Matching.

Autori: ZHIHAO GAVIN TANG XIAOWEI WU YUHAO ZHANG

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

Predmety: BIPARTITE graphs, APPROXIMATION algorithms, GREEDY algorithms, POLYNOMIAL time algorithms, ONLINE algorithms, GRAPH theory

Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark.

Autori: Braverman, Mark Derakhshan, Mahsa Molina Lovett, Antonio

Zdroj: EC: Economics & Computation; 2022, p967-985, 19p

Predmety: STOCHASTIC analysis, BENCHMARKING (Management), ALGORITHMS, STOCHASTIC processes, APPROXIMATION theory

Relative Error StreamingQuantiles.

Autori: CORMODE, GRAHAM KARNIN, ZOHAR LIBERTY, EDO a ďalší

Zdroj: Journal of the ACM; Oct2023, Vol. 70 Issue 5, p1-48, 48p

Predmety: APPROXIMATION algorithms, DATA structures, EXTREME value theory, LINEAR orderings, APPROXIMATION error, TASK analysis

Linear-Time Approximation for Maximum Weight Matching.

Autori: DUAN, RAN PETTIE, SETH

Zdroj: Journal of the ACM; Jan2014, Vol. 61 Issue 1, p1-23, 23p

Predmety: APPROXIMATION theory, LINEAR time invariant systems, LINEAR systems, DISCRETE-time systems, ALGORITHMS

Sketching Approximability of All Finite CSPs.

Autori: Chou, Chi-Ning Golovnev, Alexander Sudan, Madhu a ďalší

Zdroj: Journal of the ACM; Apr2024, Vol. 71 Issue 2, p1-74, 74p

Predmety: CONSTRAINT satisfaction, BOOLEAN functions, SEPARATION of variables, FOURIER analysis, APPROXIMATION algorithms, COMMUNICATION barriers, HYPERCUBES

Minimum Plane Bichromatic Spanning Trees.

Autori: Akitaya, Hugo A. Biniaz, Ahmad Demaine, Erik D. a ďalší

Zdroj: ACM Transactions on Algorithms; Oct2025, Vol. 21 Issue 4, p1-14, 14p

Predmety: SPANNING trees, POLYNOMIAL time algorithms, APPROXIMATION algorithms

A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching.

Autori: RAGHVENDRA, SHARATH AGARWAL, PANKAJ K.

Zdroj: Journal of the ACM; May2020, Vol. 67 Issue 3, p1-19, 19p

Predmety: MONTE Carlo method, ALGORITHMS, POINT set theory, PATTERN matching, APPROXIMATION algorithms

A \(\boldsymbol{O}(\textbf{log}\,\boldsymbol{k})\)-Approximation for Directed Steiner Tree in Planar Graphs.

Autori: Friggstad, Zachary Mousavi, Ramin

Zdroj: ACM Transactions on Algorithms; Oct2025, Vol. 21 Issue 4, p1-14, 14p

Predmety: TREE graphs, APPROXIMATION algorithms, TREES, SAWLOGS