Image de couverture de livre

Streaming Algorithms for Network Design

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chekuri, Chandra, Jain, Rhea, Mahabadi, Sepideh, Vakilian, Ali
Format:	Preprint
Publié:	2025
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 Network Design in Non-Uniform Fault Models
par: Chekuri, Chandra, et autres
Publié: (2024)

Streaming Algorithms for Connectivity Augmentation
par: Jin, Ce, et autres
Publié: (2024)

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

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

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

Sublinear Metric Steiner Forest via Maximal Independent Set
par: Mahabadi, Sepideh, et autres
Publié: (2025)

Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
par: Mahabadi, Sepideh, et autres
Publié: (2024)

Improved Algorithms for Fair Matroid Submodular Maximization
par: Mahabadi, Sepideh, et autres
Publié: (2026)

Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
par: Dong, Yinhao, et autres
Publié: (2024)

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

Guessing Efficiently for Constrained Subspace Approximation
par: Bhaskara, Aditya, et autres
Publié: (2025)

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

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time
par: Mahabadi, Sepideh, et autres
Publié: (2025)

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

Online Steiner Forest with Recourse
par: Long, Yaowei, et autres
Publié: (2026)

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)

New and Improved Bounds for Markov Paging
par: Pabbaraju, Chirag, et autres
Publié: (2025)

Graph-Based Algorithms for Diverse Similarity Search
par: Anand, Piyush, et autres
Publié: (2025)

The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
par: Blank, Lotte, et autres
Publié: (2025)

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)

Max-Cut with Multiple Cardinality Constraints
par: Makarychev, Yury, et autres
Publié: (2025)

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

Composable Coresets for Constrained Determinant Maximization and Beyond
par: Mahabadi, Sepideh, et autres
Publié: (2022)

Scalable Algorithms for Individual Preference Stable Clustering
par: Mosenzon, Ron, et autres
Publié: (2024)

An Optimal Algorithm for Stochastic Vertex Cover
par: Brand, Jan van den, et autres
Publié: (2026)

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

Learning-Based Algorithms for Graph Searching Problems
par: DePavia, Adela Frances, et autres
Publié: (2024)

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

Efficiently Computing Similarities to Private Datasets
par: Backurs, Arturs, et autres
Publié: (2024)

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

On Socially Fair Low-Rank Approximation and Column Subset Selection
par: Song, Zhao, et autres
Publié: (2024)

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

Semi-Streaming Algorithms for Hypergraph Matching
par: Reinstädtler, Henrik, et autres
Publié: (2025)

Streaming Algorithms with Few State Changes
par: Jayaram, Rajesh, et autres
Publié: (2024)

Streaming Algorithms for Geometric Steiner Forest
par: Czumaj, Artur, et autres
Publié: (2020)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut
par: Saxena, Raghuvansh R., et autres
Publié: (2024)

New Algorithms and Lower Bounds for Streaming Tournaments
par: Ghosh, Prantar, et autres
Publié: (2024)