Cover Image

Minimizing the determinant of the graph Laplacian

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Albin, Nathan, Lind, Joan, Melikyan, Anna, Poggi-Corradini, Pietro
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Optimization and Control 90C27 (Primary), 05B35 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Modulus for bases of matroids
by: Truong, Huy, et al.
Published: (2024)

Modulus of hypertrees
by: Truong, Huy, et al.
Published: (2025)

Base Modulus for Matroid Truncation, Strength, and Fractional Arboricity
by: Truong, Huy, et al.
Published: (2026)

The scaling limit of fair Peano paths
by: Albin, Nathan, et al.
Published: (2021)

Matroid reinforcement and sparsification
by: Truong, Huy, et al.
Published: (2024)

Fulkerson duality for modulus of spanning trees and partitions
by: Truong, Huy, et al.
Published: (2023)

Convergence of the Probabilistic Interpretation of Modulus
by: Albin, Nathan, et al.
Published: (2021)

Shifted and Threshold Matroids
by: Partida, Ethan
Published: (2024)

On generalized KKT points for the Motzkin-Straus program
by: Beretta, G., et al.
Published: (2023)

Sailing League Problems
by: Schüler, Robert, et al.
Published: (2022)

Quotients of M-convex sets and M-convex functions
by: Brandenburg, Marie-Charlotte, et al.
Published: (2024)

Semidefinite programming bounds on fractional cut-cover and maximum 2-SAT for highly regular graphs
by: Assumpção, Henrique, et al.
Published: (2025)

The $n$-Queens Problem in Higher Dimensions
by: Kunt, Tim
Published: (2024)

An Efficient Continuous-Time MILP for Integrated Aircraft Hangar Scheduling and Layout
by: Pazhooh, Shayan Farhang, et al.
Published: (2025)

Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
by: Druetto, Alessandro, et al.
Published: (2024)

A solution procedure for minimizing total completion time in a parallel-batching environment
by: Alfieri, Arianna, et al.
Published: (2020)

Box Allocation Optimization in Meal Kit Delivery
by: Nguyen, Thi Minh Thu, et al.
Published: (2025)

A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
by: Legault, Robin, et al.
Published: (2022)

The column number for 3-modular matrices
by: Paat, Joseph, et al.
Published: (2025)

On the Number of Degenerate Simplex Pivots
by: Kukharenko, Kirill, et al.
Published: (2023)

Totally equimodular matrices: decomposition and triangulation
by: Chervet, Patrick, et al.
Published: (2025)

Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing
by: Fravel, Jamie, et al.
Published: (2026)

Dual Cheeger Constants, Signless 1-Laplacians and Maxcut
by: Shao, Sihong, et al.
Published: (2016)

Lexicographic Extensions preserve Euclideaness
by: Hochstättler, Winfried, et al.
Published: (2025)

Vertex-shellings of Euclidean Oriented Matroids
by: Hochstättler, Winfried, et al.
Published: (2023)

Integral bases, perfect matchings, and the Petersen graph
by: Abdi, Ahmad, et al.
Published: (2025)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
by: Yang, Dominic, et al.
Published: (2025)

A simple inverse power method for balanced graph cut
by: Shao, Sihong, et al.
Published: (2024)

Predict-then-Calibrate: A New Perspective of Robust Contextual LP
by: Sun, Chunlin, et al.
Published: (2023)

Fully Leafed Induced Subtrees in Penrose P2 Tilings
by: Cloutier, Mathieu, et al.
Published: (2026)

Penrose P2 Tilings: A Study of Fully Leafed Induced Subtrees
by: Cloutier, Mathieu, et al.
Published: (2026)

Improved Bounds for the Ultimate Independence Ratio of Odd Wheels
by: Clow, Alexander, et al.
Published: (2025)

A Canceling Heuristic for the Directed Traveling Salesman Problem
by: Borgwardt, Steffen, et al.
Published: (2026)

An Integer Linear Programming Model for the Evolomino Puzzle
by: Nikolaev, Andrei V., et al.
Published: (2026)

Steiner Cut Dominants
by: Conforti, Michele, et al.
Published: (2022)

Solving the n-Queens Problem in Higher Dimensions
by: Kunt, Tim
Published: (2024)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
by: McFarland, Caleb
Published: (2026)

A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
by: Bao, Chenglong, et al.
Published: (2025)

Typical values of extremal-weight combinatorial structures with independent symmetric weights
by: Cheng, Yun, et al.
Published: (2022)

Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
by: Yuan, Qilong
Published: (2025)