:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Qian, Jingyun, Hahn, Georg
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Methodology
Acceso en línea:	https://arxiv.org/abs/2409.08350
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Scalable computation of the maximum flow in large brain connectivity networks
por: Qian, Jingyun, et al.
Publicado: (2024)

Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
por: Choromanski, Krzysztof, et al.
Publicado: (2026)

Graph Generation Methods under Partial Information
por: Sun, Tong, et al.
Publicado: (2026)

On computing and the complexity of computing higher-order $U$-statistics, exactly
por: Chen, Xingyu, et al.
Publicado: (2025)

The Conflict Graph Design: Estimating Causal Effects under Arbitrary Neighborhood Interference
por: Kandiros, Vardis, et al.
Publicado: (2024)

Causal Discovery under Off-Target Interventions
por: Choo, Davin, et al.
Publicado: (2024)

A Statistical View of Column Subset Selection
por: Sood, Anav, et al.
Publicado: (2023)

Spike-and-Slab Posterior Sampling in High Dimensions
por: Kumar, Syamantak, et al.
Publicado: (2025)

Recursive Modified Pattern Search on High-dimensional Simplex : A Blackbox Optimization Technique
por: Das, Priyam
Publicado: (2016)

Fast Computation of Leave-One-Out Cross-Validation for $k$-NN Regression
por: Kanagawa, Motonobu
Publicado: (2024)

Scalable Learning of Multivariate Distributions via Coresets
por: Ding, Zeyu, et al.
Publicado: (2026)

A faster heuristic for the Traveling Salesman Problem with Drone
por: Hokama, Pedro H. D. B., et al.
Publicado: (2024)

Finding maximum matchings in RDV graphs efficiently
por: Biedl, Therese, et al.
Publicado: (2024)

Brief announcement: A special case of maximum flow over time with network changes
por: Chawla, Shuchi, et al.
Publicado: (2026)

On computing approximate Lewis weights
por: Apers, Simon, et al.
Publicado: (2024)

Heavy-tailed Contamination is Easier than Adversarial Contamination
por: Cherapanamjeri, Yeshwanth, et al.
Publicado: (2024)

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs
por: Wienöbst, Marcel, et al.
Publicado: (2022)

A smoothed-Bayesian approach to frequency recovery from sketched data
por: Beraha, Mario, et al.
Publicado: (2023)

A Refreshment Stirred, Not Shaken: Invariant-Preserving Deployments of Differential Privacy for the U.S. Decennial Census
por: Bailie, James, et al.
Publicado: (2025)

Linear-Time Primitives for Algorithm Development in Graphical Causal Inference
por: Wienöbst, Marcel, et al.
Publicado: (2025)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
por: Feng, Weiming, et al.
Publicado: (2022)

Limits of Approximating the Median Treatment Effect
por: Addanki, Raghavendra, et al.
Publicado: (2024)

A more efficient algorithm to compute the Rand Index for change-point problems
por: Prates, Lucas de Oliveira
Publicado: (2021)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
por: Tu, Sijing, et al.
Publicado: (2025)

Optimal Stopping Methodology for the Secretary Problem with Random Queries
por: Moustakides, George V., et al.
Publicado: (2021)

Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform
por: Oliveira, P. A. M., et al.
Publicado: (2016)

Efficient parameterized approximation
por: Kratsch, Stefan, et al.
Publicado: (2025)

Approximating maximum properly colored forests via degree bounded independent sets
por: Bai, Yuhang, et al.
Publicado: (2025)

New approximate distance oracles and their applications
por: Kadria, Avi, et al.
Publicado: (2025)

Bicriteria approximation for $k$-edge-connectivity
por: Nutov, Zeev, et al.
Publicado: (2025)

Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost
por: Li, Shuguang, et al.
Publicado: (2025)

An $O(n^3)$ time algorithm for the maximum-weight limited-capacity many-to-many matching
por: Rajabi-Alni, Fatemeh, et al.
Publicado: (2014)

Locally computing edge orientations
por: Mitrović, Slobodan, et al.
Publicado: (2025)

FPT approximations for Capacitated Sum of Radii and Diameters
por: Filtser, Arnold, et al.
Publicado: (2024)

Improved bicriteria approximation for $k$-edge-connectivity
por: Nutov, Zeev
Publicado: (2025)

Improved girth approximation in weighted undirected graphs
por: Kadria, Avi, et al.
Publicado: (2025)

On the cut-query complexity of approximating max-cut
por: Plevrakis, Orestis, et al.
Publicado: (2022)

Beyond 2-approximation for k-Center in Graphs
por: Jin, Ce, et al.
Publicado: (2025)

Improved approximation ratio for covering pliable set families
por: Nutov, Zeev
Publicado: (2024)

A simple $(2+ε)$-approximation for knapsack interdiction
por: Weninger, Noah
Publicado: (2026)