:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Plevrakis, Orestis, Ragavan, Seyoon, Weinberg, S. Matthew
Format:	Preprint
Published:	2022
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2211.04506
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Catalytic Tree Evaluation From Matching Vectors
by: Henzinger, Alexandra, et al.
Published: (2026)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
by: Apers, Simon, et al.
Published: (2021)

A tight example for approximation ratio 5 for covering small cuts by the primal-dual method
by: Nutov, Zeev
Published: (2025)

Minimum+1 Steiner Cuts and Dual Edge Sensitivity Oracle: Bridging the Gap between Global cut and (s,t)-cut
by: Bhanja, Koustav
Published: (2024)

An FPT algorithm for Matching Cut and d-cut
by: Aravind, N R, et al.
Published: (2021)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
by: Tu, Sijing, et al.
Published: (2025)

On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
by: Bengali, Vedangi, et al.
Published: (2024)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
by: Daga, Mohit
Published: (2025)

On the query complexity of sampling from non-log-concave distributions
by: He, Yuchen, et al.
Published: (2025)

Faster exponential algorithms for cut problems via geometric data structures
by: Kozma, László, et al.
Published: (2025)

Temporal queries for dynamic temporal forests
by: Bilò, Davide, et al.
Published: (2024)

Optimal prefix-suffix queries with applications
by: Pissis, Solon P.
Published: (2024)

Trace reconstruction from local statistical queries
by: Chen, Xi, et al.
Published: (2024)

A scalable clustering algorithm to approximate graph cuts
by: Suchan, Leo, et al.
Published: (2023)

Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
by: d'Orsi, Tommaso, et al.
Published: (2024)

Parallel batch queries on dynamic trees: algorithms and experiments
by: Ikram, Humza, et al.
Published: (2025)

Revisiting Majumdar-Ghosh spin chain model and Max-cut problem using variational quantum algorithms
by: Britant, et al.
Published: (2024)

Finding the diameter of a tree with distance queries
by: Gerbner, Dániel, et al.
Published: (2025)

Faster exact learning of k-term DNFs with membership and equivalence queries
by: Alman, Josh, et al.
Published: (2025)

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
by: Chang, Yeonsu, et al.
Published: (2023)

A 4-approximation algorithm for min max correlation clustering
by: Heidrich, Holger, et al.
Published: (2023)

Randomized query composition and product distributions
by: Sanyal, Swagato
Published: (2024)

Rényi-infinity constrained sampling with $d^3$ membership queries
by: Kook, Yunbum, et al.
Published: (2024)

Lower bounds for graph reconstruction with maximal independent set queries
by: Michel, Lukas, et al.
Published: (2024)

Sublinear-query relative-error testing of halfspaces
by: Chen, Xi, et al.
Published: (2026)

Concurrent aggregate queries
by: Sela, Gal, et al.
Published: (2024)

Conjugate queries can help
by: Tang, Ewin, et al.
Published: (2025)

A Bicriterion Concentration Inequality and Prophet Inequalities for $k$-Fold Matroid Unions
by: Alon, Noga, et al.
Published: (2024)

On the complexity and approximability of Bounded access Lempel Ziv coding
by: Cicalese, Ferdinando, et al.
Published: (2024)

Optimal Single-Choice Prophet Inequalities from Samples
by: Rubinstein, Aviad, et al.
Published: (2019)

Efficient parameterized approximation
by: Kratsch, Stefan, et al.
Published: (2025)

Quasi-linear distance query reconstruction for graphs of bounded treelength
by: Bastide, Paul, et al.
Published: (2024)

New approximate distance oracles and their applications
by: Kadria, Avi, et al.
Published: (2025)

Bicriteria approximation for $k$-edge-connectivity
by: Nutov, Zeev, et al.
Published: (2025)

Improved bicriteria approximation for $k$-edge-connectivity
by: Nutov, Zeev
Published: (2025)

Improved girth approximation in weighted undirected graphs
by: Kadria, Avi, et al.
Published: (2025)

FPT approximations for Capacitated Sum of Radii and Diameters
by: Filtser, Arnold, et al.
Published: (2024)

Beyond 2-approximation for k-Center in Graphs
by: Jin, Ce, et al.
Published: (2025)

Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)
by: Zick, Kenneth M.
Published: (2025)

A simple $(2+ε)$-approximation for knapsack interdiction
by: Weninger, Noah
Published: (2026)