Speedup the optimization of maximal closure of a node-weighted directed acyclic graph
From MaRDI portal
Cites work
- A computation of the eighth Dedekind number
- A decision-making approach to reduce the margin of error of decision makers for bipolar soft set theory
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A New Algorithm for Computing the Maximal Closure of a Graph
- A new polynomial-time algorithm for linear programming
- A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
- An optimal polygonal boundary encoding scheme in the rate distortion sense
- Eco-driving in urban traffic networks using traffic signals information
- Edge Weight Reduction Problems in Directed Acyclic Graphs
- Guided inference of nested monotone Boolean functions
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Minimizing a Convex Cost Closure Set
- Modifying edges of a network to obtain short subgraphs
- Partitioning a weighted partial order
- Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
- Selected Applications of Minimum Cuts in Networks
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- Up- and downgrading the 1-center in a network
- Upgrading min-max spanning tree problem under various cost functions
This page was built for publication: Speedup the optimization of maximal closure of a node-weighted directed acyclic graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6105899)
