Imagen de Portada

A New Approach for Approximating Directed Rooted Networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cohen, Sarel, Kamma, Lior, Niklanovits, Aikaterini
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Connected Partitions via Connected Dominating Sets
por: Niklanovits, Aikaterini, et al.
Publicado: (2025)

Combining Crown Structures for Vulnerability Measures
por: Casel, Katrin, et al.
Publicado: (2024)

Approximate Distance Sensitivity Oracles in Subquadratic Space
por: Bilò, Davide, et al.
Publicado: (2023)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
por: Bläsius, Thomas, et al.
Publicado: (2024)

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
por: Bilò, Davide, et al.
Publicado: (2024)

Simpler and Improved Replacement Path Coverings
por: Bilò, Davide, et al.
Publicado: (2026)

Improved Distance (Sensitivity) Oracles with Subquadratic Space
por: Bilò, Davide, et al.
Publicado: (2024)

Fault-Tolerant ST-Diameter Oracles
por: Bilò, Davide, et al.
Publicado: (2023)

Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation
por: Barak, Zohar, et al.
Publicado: (2026)

Approximating Directed Connectivity in Almost-Linear Time
por: Quanrud, Kent
Publicado: (2025)

On Incremental Approximate Shortest Paths in Directed Graphs
por: Górkiewicz, Adam, et al.
Publicado: (2025)

A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs
por: Chekuri, Chandra, et al.
Publicado: (2024)

Approximating Directed Minimum Cut and Arborescence Packing via Directed Expander Hierarchies
por: Jiang, Yonggang, et al.
Publicado: (2025)

A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

A Better-Than-2 Approximation for the Directed Tree Augmentation Problem
por: Neuwohner, Meike, et al.
Publicado: (2025)

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
por: Ashvinkumar, Vikrant, et al.
Publicado: (2024)

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
por: Cohen-Addad, Vincent, et al.
Publicado: (2022)

An Improved Greedy Approximation for (Metric) $k$-Means
por: Charikar, Moses, et al.
Publicado: (2026)

Validation and Implementation of ILBFS
por: Grabovski, Fred Matanel, et al.
Publicado: (2024)

New Approximation Guarantees for The Inventory Staggering Problem
por: Alon, Noga, et al.
Publicado: (2025)

Improved Approximations for Flexible Network Design
por: Hyatt-Denesik, Dylan, et al.
Publicado: (2024)

Approximating Tensor Network Contraction with Sketches
por: Heddes, Mike, et al.
Publicado: (2026)

Directed Isoperimetry and Monotonicity Testing: A Dynamical Approach
por: Pinto Jr, Renato Ferreira
Publicado: (2024)

Approximate Cartesian Tree Matching: an Approach Using Swaps
por: Auvray, Bastien, et al.
Publicado: (2023)

New Diameter Approximations via Distance Oracle Techniques
por: Kirkpatrick, Yael, et al.
Publicado: (2026)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
por: Dory, Michal, et al.
Publicado: (2022)

New Separations and Reductions for Directed Preservers and Hopsets
por: Hoppenworth, Gary, et al.
Publicado: (2024)

Polynomial Property Testing
por: Gishboliner, Lior, et al.
Publicado: (2025)

New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
por: Heck, Sophia, et al.
Publicado: (2026)

New Parallel and Streaming Algorithms for Directed Densest Subgraph
por: Mitrović, Slobodan, et al.
Publicado: (2025)

Approximation Algorithms for Network Design in Non-Uniform Fault Models
por: Chekuri, Chandra, et al.
Publicado: (2024)

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
por: Chen, Chi-Yeh
Publicado: (2025)

On Sparsest Cut and Conductance in Directed Polymatroidal Networks
por: Chekuri, Chandra, et al.
Publicado: (2024)

A Constant-Factor Approximation for Directed Latency
por: Blauth, Jannis, et al.
Publicado: (2025)

Root-to-Leaf Scheduling in Write-Optimized Trees
por: Chung, Christopher, et al.
Publicado: (2024)

Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
por: Brakensiek, Joshua, et al.
Publicado: (2026)

Robust Scheduling on Uniform Machines -- New Results Using a Relaxed Approximation Guarantee
por: Brinkop, Hauke, et al.
Publicado: (2025)

A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
por: Çivril, Ali
Publicado: (2023)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
por: Hwang, Samuel, et al.
Publicado: (2024)