:: Library Catalog

Omslagsbillede

Saved in:

Bibliografiske detaljer
Main Authors:	Kumar, Nikhil, Nan, JJ, Swamy, Chaitanya
Format:	Preprint
Udgivet:	2025
Fag:	Data Structures and Algorithms F.2.2; G.2
Online adgang:	https://arxiv.org/abs/2507.04473
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!

Lignende værker

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

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

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

Deterministic Minimum Steiner Cut in Maximum Flow Time
af: Ding, Matthew, et al.
Udgivet: (2023)

An $O(\log \log n)$-approximate budget feasible mechanism for subadditive valuations
af: Neogi, Rian, et al.
Udgivet: (2025)

Unsplittable Multicommodity Flows in Outerplanar Graphs
af: Alemán-Espinosa, David, et al.
Udgivet: (2025)

Finding Diverse Minimum s-t Cuts
af: de Berg, Mark, et al.
Udgivet: (2023)

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

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

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

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

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

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

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

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

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

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

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

Graph Threading
af: Demaine, Erik D., et al.
Udgivet: (2023)

Approximation Algorithms for Action-Reward Query-Commit Matching
af: Derakhshan, Mahsa, et al.
Udgivet: (2026)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
af: Dabrowski, Konrad K., et al.
Udgivet: (2024)

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

Backdoors for Quantified Boolean Formulas
af: Eriksson, Leif, et al.
Udgivet: (2026)

A Tight Lower Bound for Comparison-Based Quantile Summaries
af: Cormode, Graham, et al.
Udgivet: (2019)

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

Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees
af: Høgemo, Svein
Udgivet: (2024)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
af: Bergougnoux, Benjamin, et al.
Udgivet: (2026)

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

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

Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation
af: Peterseim, Benedikt, et al.
Udgivet: (2026)

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

Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
af: Mukherjee, Sayan, et al.
Udgivet: (2025)

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

Forward-backward Contention Resolution Schemes for Fair Rationing
af: Ma, Will, et al.
Udgivet: (2025)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
af: Eiben, Eduard, et al.
Udgivet: (2023)

Graph Threading with Turn Costs
af: Demaine, Erik D., et al.
Udgivet: (2024)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
af: Dvořák, Pavel, et al.
Udgivet: (2017)

A polynomial-time algorithm for recognizing high-bandwidth graphs
af: Varona, Luis M. B.
Udgivet: (2026)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
af: Le, Hung, et al.
Udgivet: (2023)

Realizing temporal graphs from fastest travel times
af: Klobas, Nina, et al.
Udgivet: (2023)