Cover Image

An efficient heuristic for approximate maximum flow computations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Qian, Jingyun, Hahn, Georg
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Methodology
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

On computing approximate Lewis weights
by: Apers, Simon, et al.
Published: (2024)

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

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

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

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

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

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

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

Efficient parameterized approximation
by: Kratsch, Stefan, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

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

Locally computing edge orientations
by: Mitrović, Slobodan, et al.
Published: (2025)

Improved approximation ratio for covering pliable set families
by: Nutov, Zeev
Published: (2024)

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

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

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

A framework for boosting matching approximation: parallel, distributed, and dynamic
by: Mitrović, Slobodan, et al.
Published: (2025)

Temporal Graph Reconfiguration for Always-Connected Graphs
by: Sievers, Paul, et al.
Published: (2025)