On an ordering problem in weighted hypergraphs

DOI10.1007/978-3-030-79987-8_18OpenAlexW3173973075MaRDI QIDQ2115861

Peter Damaschke

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_18

zbMATH Keywords

convex hullbipartite matchingdynamic programming on subsetswarehouse logisticshypergraph linear arrangement

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• An improved approximation ratio for the minimum linear arrangement problem
• Parameterized algorithmics for linear arrangement problems
• A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
• The deterministic product location problem under a pick-by-order policy
• Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
• Minimum Linear Arrangement of Series-Parallel Graphs
• Bipartite Matching with Linear Edge Weights
• Tractable Parameterizations for the Minimum Linear Arrangement Problem
• Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
• Fibonacci heaps and their uses in improved network optimization algorithms
• A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees
• Optimal Linear Arrangement of Interval Graphs

This page was built for publication: On an ordering problem in weighted hypergraphs