Suchergebnisse - sublinear and near linear time algorithms phrases Streaming algorithms*

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

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

Weitere Verfasser: Chien-Chung Huang François Sellier Huang, Chien-Chung

Quelle: Algorithmica. 86:3598-3628

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2107.13071
https://hal.science/hal-03982431v1

Sliding Window Property Testing for Regular Languages

Autoren: Ganardi, Moses Hucke, Danny Lohrey, Markus et al.

Weitere Verfasser: Ganardi, Moses Hucke, Danny Lohrey, Markus et al.

Quelle: 30th International Symposium on Algorithms and Computation (ISAAC 2019)
https://hal.science/hal-03942948
30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019, ShangHai, China. ⟨10.4230/LIPIcs.ISAAC.2019.6⟩

Schlagwörter: 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms phrases Streaming algorithms approximation algorithms regular languages, 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms phrases Streaming algorithms, approximation algorithms, regular languages, [INFO]Computer Science [cs]

Geographisches Schlagwort: ShangHai, China

Relation: hal-03942948; https://hal.science/hal-03942948; https://hal.science/hal-03942948/document; https://hal.science/hal-03942948/file/LIPIcs-ISAAC-2019-6.pdf

Verfügbarkeit: https://hal.science/hal-03942948
https://hal.science/hal-03942948/document
https://hal.science/hal-03942948/file/LIPIcs-ISAAC-2019-6.pdf
https://doi.org/10.4230/LIPIcs.ISAAC.2019.6

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

Autoren: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) et al.

Weitere Verfasser: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) et al.

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

Schlagwörter: 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]

Geographisches Schlagwort: Seattle, United States

Verfügbarkeit: https://hal.science/hal-03982431
https://hal.science/hal-03982431v1/document
https://hal.science/hal-03982431v1/file/2107.13071.pdf

Enhancing Data Compression: Recent Innovations in LZ77 Algorithms.

Autoren: Hong, Aaron Boucher, Christina

Quelle: Journal of Computational Biology; Aug2025, Vol. 32 Issue 8, p761-780, 20p

Optimizing Offer Sets in Sub-Linear Time.

Autoren: FARIAS, VIVEK F. LI, ANDREW A. SINHA, DEEKSHA

Quelle: EC: Economics & Computation; 2020, p639-640, 2p

Schlagwörter: COMMERCIAL products, MANUFACTURED products, ALGORITHMS, MACHINE theory, ECONOMICS, SOCIAL sciences

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.

Autoren: Dong, Sally Gao, Yu Goranci, Gramoz et al.

Quelle: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-75, 75p

Schlagwörter: PLANAR graphs, INTERIOR-point methods, SPARSE graphs, ALGORITHMS, DATA structures, FLUID flow, TIME complexity

Vertex Connectivity in Poly-logarithmic Max-Flows.

Autoren: Li, Jason Nanongkai, Danupon Panigrahi, Debmalya et al.

Quelle: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-34, 34p

Schlagwörter: GRAPH connectivity, COMPUTATIONAL complexity, DIRECTED graphs, ALGORITHMS, UNDIRECTED graphs

RANGE (RÉNYI) ENTROPY QUERIES AND PARTITIONING.

Autoren: ESMAILPOUR, ARYAN KRISHNAN, SANJAY SINTOS, STAVROS

Quelle: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 4, p17:1-17:49, 49p

A Linear-Time n^0.4-Approximation for Longest Common Subsequence.

Autoren: BRINGMANN, KARL COHEN-ADDAD, VINCENT DAS, DEBARATI

Quelle: ACM Transactions on Algorithms; Jan2023, Vol. 19 Issue 1, p1-24, 24p

Schlagwörter: APPROXIMATION algorithms, DYNAMIC programming, COMMUNITIES, EXPECTATION-maximization algorithms

Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance.

Autoren: Gudmundsson, Joachim Seybold, Martin P. Wong, Sampson

Quelle: ACM Transactions on Algorithms; Apr2024, Vol. 20 Issue 2, p1-33, 33p

Schlagwörter: DATA structures, POLYNOMIAL time algorithms, PLANAR graphs, GRAPH algorithms, APPROXIMATION algorithms, MATCHING theory, COMPUTATIONAL geometry

Counting Subgraphs in Degenerate Graphs.

Autoren: BERA, SUMAN K. GISHBOLINER, LIOR LEVANZOV, YEVGENY et al.

Quelle: Journal of the ACM; May2022, Vol. 69 Issue 3, p1-21, 21p

Schlagwörter: PLANAR graphs, COUNTING, STOCHASTIC processes, CHARTS, diagrams, etc., HOMOMORPHISMS, GRAPH algorithms, PROBLEM solving, SUBGRAPHS

Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time.

Autoren: CHAKRABORTY, DIPTARKA DAS, DEBARATI GOLDENBERG, ELAZAR et al.

Quelle: Journal of the ACM; 2020, Vol. 67 Issue 6, p1-22, 22p

Schlagwörter: DISTANCES, DYNAMIC programming, APPROXIMATION algorithms

Delegating Computation: Interactive Proofs for Muggles.

Autoren: GOLDWASSER, SHAFI KALAI, YAEL TAUMAN ROTHBLUM, GUY N.

Quelle: Journal of the ACM; Aug2015, Vol. 62 Issue 4, p1-64, 64p

Schlagwörter: POLYNOMIAL time algorithms, COMPUTATIONAL complexity, ALGORITHMS, COMPUTABLE functions, THEORY

Tolerant Testers of Image Properties.

Autoren: BERMAN, PIOTR MURZABULATOV, MEIRAM RASKHODNIKOVA, SOFYA

Quelle: ACM Transactions on Algorithms; Nov2022, Vol. 18 Issue 4, p1-39, 39p

Schlagwörter: APPROXIMATION algorithms, IMAGE processing, CONVEX sets, DYNAMIC programming, MATHEMATICAL connectedness, COMPUTATIONAL geometry, POLYGONS

Dynamic Parameterized Problems and Algorithms.

Autoren: ALMAN, JOSH MNICH, MATTHIAS WILLIAMS, VIRGINIA VASSILEVSKA

Quelle: ACM Transactions on Algorithms; Jun2020, Vol. 16 Issue 4, p1-46, 46p

Schlagwörter: NP-hard problems, ALGORITHMS, DATA structures

Smaller Cuts, Higher Lower Bounds.

Autoren: ABBOUD, AMIR CENSOR-HILLEL, KEREN KHOURY, SERI et al.

Quelle: ACM Transactions on Algorithms; Oct2021, Vol. 17 Issue 4, p1-40, 40p

Schlagwörter: DENSE graphs, GRAPH coloring, INDEPENDENT sets, SPARSE graphs, NP-hard problems, GRID computing

Constant Time Graph Neural Networks.

Autoren: RYOMA SATO MAKOTO YAMADA HISASHI KASHIMA

Quelle: ACM Transactions on Knowledge Discovery from Data; Mar2022, Vol. 16 Issue 5, p1-31, 31p

Schlagwörter: APPROXIMATION error, RECOMMENDER systems, QUESTION answering systems, SOCIAL networks, ARTIFICIAL neural networks, SAMPLING methods

Sublinear Estimation of Entropy and Information Distances.

Autoren: Guha, Sudipto Mcgregor, Andrew Venkatasubramanian, Suresh

Quelle: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 4, p35-35:16, 16p, 4 Diagrams

Schlagwörter: DATA mining, ENTROPY, DATABASE searching, ESTIMATION theory, BINARY large objects, SYSTEM analysis

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.

Autoren: Bhattacharya, Sayan Kiss, Peter Saranurak, Thatchaphol et al.

Quelle: Journal of the ACM; Oct2024, Vol. 71 Issue 5, p1-32, 32p

Schlagwörter: GRAPH algorithms, OPEN-ended questions, ALGORITHMS

Streaming Algorithms for Geometric Steiner Forest.

Autoren: Czumaj, Artur Jiang, Shaofeng H.-C. Krauthgamer, Robert et al.

Quelle: ACM Transactions on Algorithms; Oct2024, Vol. 20 Issue 4, p1-38, 38p

Schlagwörter: COST estimates, OPEN-ended questions, GENERALIZATION, ALGORITHMS, MEMORY