:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Davari, Morteza, Moura, Phablo F. S., Yaman, Hande
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Discrete Mathematics 90C11, 68Q25
Acceso en línea:	https://arxiv.org/abs/2504.02421
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Polyhedral approach to weighted connected matchings in general graphs
por: Samer, Phillippe, et al.
Publicado: (2023)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
por: Grobben, Kobe, et al.
Publicado: (2025)

Sublinear-Time Computation in the Presence of Online Erasures
por: Kalemaj, Iden, et al.
Publicado: (2021)

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
por: Meusel, Julia, et al.
Publicado: (2025)

Coloring Hardness on Low Twin-Width Graphs
por: Bonnet, Édouard
Publicado: (2025)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
por: Bonnet, Édouard, et al.
Publicado: (2026)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
por: Laekhanukit, Bundit
Publicado: (2024)

Optimal Discretization is Fixed-parameter Tractable
por: Kratsch, Stefan, et al.
Publicado: (2020)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
por: Hougardy, Stefan, et al.
Publicado: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
por: Feldman, Moran, et al.
Publicado: (2026)

Answering Related Questions
por: Bonnet, Édouard
Publicado: (2025)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction
por: Mühlenthaler, Moritz, et al.
Publicado: (2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)

An Algorithm to Recover Shredded Random Matrices
por: Atamanchuk, Caelan, et al.
Publicado: (2023)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
por: Heimann, Sophia, et al.
Publicado: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
por: Hougardy, Stefan, et al.
Publicado: (2024)

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

Compact formulations and valid inequalities for parallel machine scheduling with conflicts
por: Moura, Phablo F. S., et al.
Publicado: (2023)

Optimal Hardness of Online Algorithms for Large Independent Sets
por: Gamarnik, David, et al.
Publicado: (2025)

Interval Graphs are Reconstructible
por: Heinrich, Irene, et al.
Publicado: (2025)

Supermodular Maximization with Cardinality Constraints
por: Chen, Xujin, et al.
Publicado: (2025)

Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole
por: Haxell, Penny, et al.
Publicado: (2022)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
por: Ammann, Sabrina C. L., et al.
Publicado: (2024)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
por: Sun, Hao
Publicado: (2023)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
por: Foucaud, Florent, et al.
Publicado: (2026)

On weighted graph separation problems and flow-augmentation
por: Kim, Eun Jung, et al.
Publicado: (2022)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
por: Michel, Stefan
Publicado: (2025)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
por: Liu, Bowen
Publicado: (2025)

Mim-Width is paraNP-complete
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Treewidth Inapproximability and Tight ETH Lower Bound
por: Bonnet, Édouard
Publicado: (2024)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

APTAS for bin packing with general cost structures
por: Jaykrishnan, G., et al.
Publicado: (2024)

Bicriteria Submodular Maximization
por: Feldman, Moran, et al.
Publicado: (2025)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
por: Buchbinder, Niv, et al.
Publicado: (2024)

Generation of weighted trees, block trees and block graphs
por: Ekim, Tınaz, et al.
Publicado: (2024)

Scheduling with Time Dependent Utilities: Fairness and Efficiency
por: Nicosia, Gaia, et al.
Publicado: (2026)

Pliability and Approximating Max-CSPs
por: Romero, Miguel, et al.
Publicado: (2019)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
por: Mundhra, S.
Publicado: (2025)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
por: Goerigk, Marc, et al.
Publicado: (2026)

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