Cover Image

Unsplittable Multicommodity Flows in Outerplanar Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alemán-Espinosa, David, Kumar, Nikhil
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms F.2.2; G.1.6; G.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approximation Algorithms for Correlated Knapsack Orienteering
by: Espinosa, David Aleman, et al.
Published: (2024)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
by: Salas, Jesus
Published: (2025)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
by: Gillman, David, et al.
Published: (2025)

Better Approximation for Weighted $k$-Matroid Intersection
by: Singer, Neta, et al.
Published: (2024)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
by: Bläsius, Thomas, et al.
Published: (2024)

Smoothed Analysis of Interior-Point Algorithms: Condition Number
by: Dunagan, John, et al.
Published: (2003)

Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching
by: Donkiewicz, Tim, et al.
Published: (2026)

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)

Generating Signed Permutations by Twisting Two-Sided Ribbons
by: Yuan, et al.
Published: (2023)

Efficient Uniform Sampling of Surjections via their Profiles
by: Carayol, Arnaud, et al.
Published: (2026)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
by: Shota, Kan, et al.
Published: (2024)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
by: Adamson, Duncan, et al.
Published: (2023)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
by: Hochbaum, Dorit S.
Published: (2016)

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

Eliminating Illusion in Directed Networks
by: Jana, Sougata, et al.
Published: (2026)

Approximation algorithms for the prize-collecting rural postman problem
by: Li, Hong, et al.
Published: (2026)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
by: Könen, David, et al.
Published: (2023)

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
by: Kumar, Nikhil, et al.
Published: (2025)

Constant-Factor Distortion Mechanisms for $k$-Committee Election
by: Pulyassary, Haripriya, et al.
Published: (2025)

Restless reachability problems in temporal graphs
by: Thejaswi, Suhas, et al.
Published: (2020)

CART-ELC: Oblique Decision Tree Induction via Exhaustive Search
by: Laack, Andrew D.
Published: (2025)

Beating Meet-in-the-Middle for Subset Balancing Problems
by: Randolph, Tim, et al.
Published: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
by: Randolph, Tim, et al.
Published: (2024)

Graph Threading
by: Demaine, Erik D., et al.
Published: (2023)

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

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

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
by: Li, Shisheng
Published: (2026)

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

Succinct QUBO formulations for permutation problems by sorting networks
by: Friedl, Katalin, et al.
Published: (2026)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
by: Bhattacharjee, Rajarshi, et al.
Published: (2023)

An improved approximation algorithm for k-Median
by: Young, Neal E.
Published: (2025)

Structural Parameterization of Steiner Tree Packing
by: Hastrich, Niko, et al.
Published: (2025)

JFR: An Efficient Jump Frontier Relaxation Strategy for Bellman-Ford
by: Wang, Xin, et al.
Published: (2025)

Customizable Contraction Hierarchies -- A Survey
by: Bläsius, Thomas, et al.
Published: (2025)

Maintaining Routing Structures under Deletions via Self-Pruning
by: Haeupler, Bernhard, et al.
Published: (2025)

Faster shortest-path algorithms using the acyclic-connected tree
by: Stefansson, Elis, et al.
Published: (2025)

Fast and Simple Sorting Using Partial Information
by: Haeupler, Bernhard, et al.
Published: (2024)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
by: Dereniowski, Dariusz, et al.
Published: (2024)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
by: Haeupler, Bernhard, et al.
Published: (2023)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
by: Haeupler, Bernhard, et al.
Published: (2024)