Cover Image

Planning For Edge Failure in Fixed-Charge Flow Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Olson, Daniel, Eardley, Caleb, Yaw, Sean
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computational Engineering, Finance, and Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Vehicle Routing with Pickups and Deliveries under Time-Dependent Travel-Time Constraints
by: Kontogiannis, Spyros, et al.
Published: (2024)

Btrim: A fast, lightweight adapter and quality trimming program for next-generation sequencing technologies
by: Kong, Yong
Published: (2014)

A Linear Time Quantum Algorithm for Pairwise Sequence Alignment
by: Khan, Md. Rabiul Islam, et al.
Published: (2023)

Controlling the Spread of Epidemics on Networks with Differential Privacy
by: Nguyen, Dung, et al.
Published: (2025)

ReeSPOT: Reeb Graph Models Semantic Patterns of Normalcy in Human Trajectories
by: Zhang, Bowen, et al.
Published: (2024)

Rapid GPU-Based Pangenome Graph Layout
by: Li, Jiajie, et al.
Published: (2024)

Fast multiplication of random dense matrices with fixed sparse matrices
by: Liang, Tianyu, et al.
Published: (2023)

Sensitivity-Aware Density Estimation in Multiple Dimensions
by: Boquet-Pujadas, Aleix, et al.
Published: (2025)

Computational Complexity of Edge Coverage Problem for Constrained Control Flow Graphs
by: Ruszil, Jakub, et al.
Published: (2026)

GPU-Native Compressed Neighbor Lists with a Space-Filling-Curve Data Layout
by: Thaler, Felix, et al.
Published: (2026)

Quantum Speedups for Derivative Pricing Beyond Black-Scholes
by: Herman, Dylan, et al.
Published: (2026)

An Algorithm for Optimal Partitioning of Data on an Interval
by: Jackson, Brad, et al.
Published: (2003)

Polynomial time algorithm for optimal stopping with fixed accuracy
by: Goldberg, David A., et al.
Published: (2018)

Exact Exploration
by: Blass, Andreas, et al.
Published: (2024)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
by: Chen, Yong, et al.
Published: (2025)

Computing Tarski Fixed Points in Financial Networks
by: Besting, Leander, et al.
Published: (2026)

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
by: Gupta, Sushmita, et al.
Published: (2025)

Efficient Decrease-and-Conquer Linearizability Monitoring
by: Han, Lee Zheng, et al.
Published: (2024)

Edge-Weighted Online Bipartite Matching
by: Fahrbach, Matthew, et al.
Published: (2020)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
by: Mizutani, Yosuke, et al.
Published: (2024)

Homogeneous Network Caching is Fixed-Parameter Tractable Parameterized by the Number of Caches
by: Pintér, József, et al.
Published: (2026)

Efficient Heuristics and Exact Methods for Pairwise Interaction Sampling
by: Fekete, Sándor P., et al.
Published: (2025)

Edge-weighted Online Stochastic Matching Under Jaillet-Lu LP
by: Yan, Shuyi
Published: (2025)

A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures
by: Haeupler, Bernhard, et al.
Published: (2026)

Edge-weighted Online Stochastic Matching: Beating $1-\frac1e$
by: Yan, Shuyi
Published: (2022)

Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
by: Pashkovich, Kanstantsin, et al.
Published: (2026)

Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
by: de Colnet, Alexis, et al.
Published: (2026)

Computing a Fixed Point of Contraction Maps in Polynomial Queries
by: Chen, Xi, et al.
Published: (2024)

Uniform Sampling of Negative Edge Weights in Shortest Path Networks
by: Geis, Lukas, et al.
Published: (2024)

Partitioning Trillion Edge Graphs on Edge Devices
by: Chhabra, Adil, et al.
Published: (2024)

Fixed-Parameter Tractability of Hedge Cut
by: Fomin, Fedor V., et al.
Published: (2024)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
by: Anand, Aditya, et al.
Published: (2024)

Quadratic Speedup for Computing Contraction Fixed Points
by: Chen, Xi, et al.
Published: (2026)

Robust Restaking Networks
by: Durvasula, Naveen, et al.
Published: (2024)

The Mystery Deepens: On the Query Complexity of Tarski Fixed Points
by: Chen, Xi, et al.
Published: (2026)

Fixed Point Computation: Beating Brute Force with Smoothed Analysis
by: Attias, Idan, et al.
Published: (2025)

Broadcasting in Heterogeneous Tree Networks with Edge Weight Uncertainty
by: Tsou, Cheng-Hsiao, et al.
Published: (2024)

Buffered Streaming Edge Partitioning
by: Chhabra, Adil, et al.
Published: (2024)

Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search
by: Brous, Daniel, et al.
Published: (2025)

Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
by: Halpern, Daniel, et al.
Published: (2025)