Imagen de Portada

Maximizing the Minimum Eigenvalue in Constant Dimension

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Brown, Adam, Laddha, Aditi, Singh, Mohit
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

Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
por: Brown, Adam, et al.
Publicado: (2024)

A Poisson Process for Submodular Maximization
por: Rozenman, Amit Ganz, et al.
Publicado: (2026)

Reducing Isotropy and Volume to KLS: Faster Rounding and Volume Algorithms
por: Jia, He, et al.
Publicado: (2020)

Faster Global Minimum Cut with Predictions
por: Moseley, Benjamin, et al.
Publicado: (2025)

The Cost of Consistency: Submodular Maximization with Constant Recourse
por: Dütting, Paul, et al.
Publicado: (2024)

A Note on Rounding Matchings in General Graphs
por: Dudeja, Aditi
Publicado: (2024)

Tight Sampling Bounds for Eigenvalue Approximation
por: Swartworth, William, et al.
Publicado: (2024)

Distributed Sparsest Cut via Eigenvalue Estimation
por: Maus, Yannic, et al.
Publicado: (2025)

A Weighted-to-Unweighted Reduction for Matroid Intersection
por: Dudeja, Aditi, et al.
Publicado: (2026)

Approximation Algorithms for D-optimal Design
por: Singh, Mohit, et al.
Publicado: (2018)

Constant sensitivity on the CDAWGs
por: Hamai, Rikuya, et al.
Publicado: (2025)

Width Parameters for Minimum Flow Decomposition
por: Grigorjew, Andreas, et al.
Publicado: (2024)

Faster Pseudo-Deterministic Minimum Cut
por: Kenneth-Mordoch, Yotam
Publicado: (2026)

Minimum Temporal Spanners in Happy Graphs
por: Casteigts, Arnaud, et al.
Publicado: (2026)

Minimum $s$--$t$ Cuts with Fewer Cut Queries
por: Jiang, Yonggang, et al.
Publicado: (2025)

Thin Trees for Near Minimum Cuts
por: Klein, Nathan, et al.
Publicado: (2026)

Exact Optimization for Minimum Dominating Sets
por: Zhu, Enqiang, et al.
Publicado: (2025)

Constant-Stretch Rounding on the Hypersimplex
por: Anari, Nima, et al.
Publicado: (2026)

Learning Minimum Linear Arrangement of Cliques and Lines
por: Dallot, Julien, et al.
Publicado: (2024)

Parameterized Algorithms for Minimum Sum Vertex Cover
por: Aute, Shubhada, et al.
Publicado: (2024)

Simple Length-Constrained Minimum Spanning Trees
por: Hershkowitz, D Ellis, et al.
Publicado: (2024)

Planar Length-Constrained Minimum Spanning Trees
por: Hershkowitz, D Ellis, et al.
Publicado: (2025)

Connectivity-Preserving Minimum Separator in AT-free Graphs
por: Kenig, Batya
Publicado: (2025)

Improving Pinwheel Density Bounds for Small Minimums
por: Mishra, Ahan, et al.
Publicado: (2025)

Near-Optimal Minimum Cuts in Hypergraphs at Scale
por: Chhabra, Adil, et al.
Publicado: (2025)

Minimum-Peak-Cost Flows Over Time
por: Anapolska, Mariia, et al.
Publicado: (2025)

Computing Experiment-Constrained D-Optimal Designs
por: Pillai, Aditya, et al.
Publicado: (2024)

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

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
por: DeHaan, Ian, et al.
Publicado: (2025)

Edge-Minimum Walk of Modular Length in Polynomial Time
por: Amarilli, Antoine, et al.
Publicado: (2024)

Minimum sum vertex cover: kernelization and parameterized algorithms
por: Cao, Yixin, et al.
Publicado: (2024)

Stochastic Minimum Spanning Trees with a Single Sample
por: Hoeksma, Ruben, et al.
Publicado: (2024)

Cactus Representation of Minimum Cuts: Derandomize and Speed up
por: He, Zhongtian, et al.
Publicado: (2024)

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
por: Ito, Takehiro, et al.
Publicado: (2025)

Encodings for Range Minimum Queries over Bounded Alphabets
por: Jo, Seungbum, et al.
Publicado: (2026)

The Power of Greedy for Online Minimum Cost Matching on the Line
por: Balkanski, Eric, et al.
Publicado: (2022)

Counting Patterns in Degenerate Graphs in Constant Space
por: Komarath, Balagopal, et al.
Publicado: (2025)

Kernelization for Orthogonality Dimension
por: Haviv, Ishay, et al.
Publicado: (2024)

Massively Parallel Minimum Spanning Tree in General Metric Spaces
por: Azarmehr, Amir, et al.
Publicado: (2024)

Space Complexity of Minimum Cut Problems in Single-Pass Streams
por: Ding, Matthew, et al.
Publicado: (2024)