On an ordering problem in weighted hypergraphs

DOI10.1007/978-3-030-79987-8_18MaRDI QIDQ2115861OpenAlexFDO

Authors 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)

Recommendations

• An Edge Ordering Problem of Regular Hypergraphs
• On the complexity of a linear ordering of weighted directed acyclic graphs
• On ordered graphs and graph orderings
• On properly ordered coloring of vertices in a vertex-weighted graph
• On the rank of weighted graphs
• Helly-type theorems for the ordering of the vertices of a hypergraph
• Some properties of ordered hypergraphs
• Weight choosability of oriented hypergraphs

Cites work

• scientific article; zbMATH DE number 4043771 (Why is no real title available?)
• A correction on Shiloach's algorithm for minimum linear arrangement of trees
• A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
• An improved approximation ratio for the minimum linear arrangement problem
• Bipartite matching with linear edge weights
• Fibonacci heaps and their uses in improved network optimization algorithms
• Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
• Minimum Linear Arrangement of Series-Parallel Graphs
• Optimal Linear Arrangement of Interval Graphs
• Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
• Parameterized algorithmics for linear arrangement problems
• The deterministic product location problem under a pick-by-order policy
• Tractable parameterizations for the minimum linear arrangement problem

Cited in

(3)

• Helly-type theorems for the ordering of the vertices of a hypergraph
• An order approach for the core maintenance problem on edge-weighted graphs
• Finding the \(N\) best vertices in an infinite weighted hypergraph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115861)