Image de couverture de livre

Approximation Algorithms for Network Design in Non-Uniform Fault Models

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chekuri, Chandra, Jain, Rhea
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
par: Chekuri, Chandra, et autres
Publié: (2024)

A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs
par: Chekuri, Chandra, et autres
Publié: (2024)

Streaming Algorithms for Network Design
par: Chekuri, Chandra, et autres
Publié: (2025)

Node-Weighted Multicut in Planar Digraphs
par: Chekuri, Chandra, et autres
Publié: (2026)

From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
par: Chekuri, Chandra, et autres
Publié: (2024)

On Sparsest Cut and Conductance in Directed Polymatroidal Networks
par: Chekuri, Chandra, et autres
Publié: (2024)

Colorful Priority $k$-Supplier
par: Chekuri, Chandra, et autres
Publié: (2024)

Online Disjoint Spanning Trees and Polymatroid Bases
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2025)

On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2025)

Exponential Time Approximation for Coloring 3-Colorable Graphs
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Hedgegraph Polymatroids
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2025)

Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems
par: Harb, Elfarouk, et autres
Publié: (2025)

Hypergraph Splitting-Off via Element-Connectivity Preserving Reductions
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2025)

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2023)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
par: Łącki, Jakub, et autres
Publié: (2025)

Uncrossed Multiflows and Applications to Disjoint Paths
par: Chekuri, Chandra, et autres
Publié: (2025)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
par: Armbruster, Alexander, et autres
Publié: (2026)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
par: Zhao, Jingyang, et autres
Publié: (2025)

Toward Optimal Approximations for Resource-Minimization for Fire Containment on Trees and Non-Uniform k-Center
par: Blauth, Jannis, et autres
Publié: (2025)

Improved Approximations for Flexible Network Design
par: Hyatt-Denesik, Dylan, et autres
Publié: (2024)

Cycle Cancellation for Submodular Fractional Allocations and Applications
par: Chekuri, Chandra, et autres
Publié: (2025)

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
par: Chen, Chi-Yeh
Publié: (2025)

Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
par: Lamprou, Ioannis, et autres
Publié: (2025)

Fault-Tolerant Approximate Distance Oracles with a Source Set
par: Dey, Dipan, et autres
Publié: (2025)

Covering a Few Submodular Constraints and Applications
par: Bajpai, Tanvi, et autres
Publié: (2025)

Expander Decomposition for Non-Uniform Vertex Measures
par: Agassy, Daniel, et autres
Publié: (2025)

An Optimal Sorting Algorithm for Persistent Random Comparison Faults
par: Geissmann, Barbara, et autres
Publié: (2025)

The Impact of Approximation on Algorithmic Progress
par: Li, Jeffery, et autres
Publié: (2026)

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines
par: Rohwedder, Lars
Publié: (2025)

Approximation Algorithms for D-optimal Design
par: Singh, Mohit, et autres
Publié: (2018)

Robust Scheduling on Uniform Machines -- New Results Using a Relaxed Approximation Guarantee
par: Brinkop, Hauke, et autres
Publié: (2025)

Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
par: Chen, Yixin, et autres
Publié: (2025)

Efficient Algorithms to Compute Closed Substrings
par: Jain, Samkith K, et autres
Publié: (2025)

Approximation Algorithms for Steiner Connectivity Augmentation
par: Hathcock, Daniel, et autres
Publié: (2023)

Improved Additive Approximation Algorithms for APSP
par: Jin, Ce, et autres
Publié: (2025)

Approximation Algorithms for Fair Repetitive Scheduling
par: Hermelin, Danny, et autres
Publié: (2025)

Approximation Algorithms for Digraph Width Parameters
par: Kintali, Shiva, et autres
Publié: (2011)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
par: Basiak, Mateusz, et autres
Publié: (2025)

An Improved Approximation Algorithm for Metric Triangle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

Hardness and Approximation Algorithms for Balanced Districting Problems
par: Dharangutte, Prathamesh, et autres
Publié: (2025)