Copertina

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hommelsheim, Felix, Liu, Zhenwei, Megow, Nicole, Zhang, Guochuan
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
di: Lindermayr, Alexander, et al.
Pubblicazione: (2025)

Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
di: Chen, Lin, et al.
Pubblicazione: (2025)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
di: Bampis, Evripidis, et al.
Pubblicazione: (2024)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
di: Kumar, Nikhil, et al.
Pubblicazione: (2025)

Connected Components in Linear Work and Near-Optimal Time
di: Farhadi, Alireza, et al.
Pubblicazione: (2023)

Structure and Independence in Hyperbolic Uniform Disk Graphs
di: Bläsius, Thomas, et al.
Pubblicazione: (2024)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
di: Ahn, Jungho, et al.
Pubblicazione: (2025)

On Hardness and Approximation of Broadcasting in Structured Graphs
di: Bringolf, Jeffrey, et al.
Pubblicazione: (2025)

Colorful Vertex Recoloring of Bipartite Graphs
di: Patt-Shamir, Boaz, et al.
Pubblicazione: (2025)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
di: Bauernöppel, Frank, et al.
Pubblicazione: (2025)

On the Online Weighted Non-Crossing Matching Problem
di: Boyar, Joan, et al.
Pubblicazione: (2026)

Counting large patterns in degenerate graphs
di: Awofeso, Christine, et al.
Pubblicazione: (2025)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
di: Chuzhoy, Julia, et al.
Pubblicazione: (2025)

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
di: Roditty, Liam, et al.
Pubblicazione: (2026)

Graph Threading
di: Demaine, Erik D., et al.
Pubblicazione: (2023)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
di: Mosenzon, Ron
Pubblicazione: (2025)

Sorting and Ranking of Self-Delimiting Numbers with Applications to Outerplanar Graph Isomorphism
di: Kammer, Frank, et al.
Pubblicazione: (2020)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
di: Balzotti, Lorenzo
Pubblicazione: (2020)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
di: DeHaan, Ian, et al.
Pubblicazione: (2024)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
di: Awofeso, Christine, et al.
Pubblicazione: (2025)

A Better-Than-$5/4$-Approximation for Two-Edge Connectivity
di: Hommelsheim, Felix, et al.
Pubblicazione: (2025)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
di: Ibrahimpur, Sharat, et al.
Pubblicazione: (2025)

Multiplication of 0-1 matrices via clustering
di: Jansson, Jesper, et al.
Pubblicazione: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
di: Kowaluk, Mirosław, et al.
Pubblicazione: (2025)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
di: Dreier, Jan, et al.
Pubblicazione: (2026)

Minimizing the Weighted Makespan with Restarts on a Single Machine
di: Amouzandeh, Aflatoun, et al.
Pubblicazione: (2025)

On the Approximability of Unsplittable Flow on a Path with Time Windows
di: Armbruster, Alexander, et al.
Pubblicazione: (2025)

Search and evacuation with a near majority of faulty agents
di: Czyzowicz, J., et al.
Pubblicazione: (2026)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
di: Goswami, Mayank, et al.
Pubblicazione: (2022)

Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
di: Szyfelbein, Michał
Pubblicazione: (2025)

Online Combinatorial Optimization with Graphical Dependencies
di: Gao, Zhimeng, et al.
Pubblicazione: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
di: Bruchhold, Sebastian, et al.
Pubblicazione: (2025)

Online computation of normalized substring complexity
di: Kucherov, Gregory, et al.
Pubblicazione: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
di: Gong, Mingyang, et al.
Pubblicazione: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
di: Emmerich, Michael
Pubblicazione: (2025)

Hierarchical Exponential Search Via K-Spines
di: Dong, Bob
Pubblicazione: (2025)

Simple in-place yet comparison-optimal Mergesort
di: Siebert, Christian
Pubblicazione: (2025)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
di: Kanellopoulos, Sotiris, et al.
Pubblicazione: (2025)

Impact of Knowledge on the Cost of Treasure Hunt in Trees
di: Bouchard, Sébastien, et al.
Pubblicazione: (2025)

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
di: Duan, Ran, et al.
Pubblicazione: (2025)