On an ordering problem in weighted hypergraphs
From MaRDI portal
Publication:2115861
DOI10.1007/978-3-030-79987-8_18OpenAlexW3173973075MaRDI QIDQ2115861FDOQ2115861
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_18
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
- On the approximability of digraph ordering
- On the approximability of digraph ordering
- Some properties of ordered hypergraphs
- Weight choosability of oriented hypergraphs
convex hullbipartite matchingdynamic programming on subsetswarehouse logisticshypergraph linear arrangement
Cites Work
- Fibonacci heaps and their uses in improved network optimization algorithms
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- Title not available (Why is that?)
- Parameterized algorithmics for linear arrangement problems
- Tractable Parameterizations for the Minimum Linear Arrangement Problem
- An improved approximation ratio for the minimum linear arrangement problem
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
- Optimal Linear Arrangement of Interval Graphs
- The deterministic product location problem under a pick-by-order policy
- Minimum Linear Arrangement of Series-Parallel Graphs
- Bipartite Matching with Linear Edge Weights
- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
- A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees
Cited In (3)
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)
