Speedup the optimization of maximal closure of a node-weighted directed acyclic graph
From MaRDI portal
Publication:6105899
DOI10.1007/s12597-022-00595-zOpenAlexW4284959781MaRDI QIDQ6105899
No author found.
Publication date: 26 June 2023
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-022-00595-z
maximal closurenode-weighted directed acyclic graphoptimal monotonic Boolean functionpruning costweighted partial order set
Cites Work
- Unnamed Item
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- A new polynomial-time algorithm for linear programming
- Partitioning a weighted partial order
- Up- and downgrading the 1-center in a network
- A computation of the eighth Dedekind number
- Modifying edges of a network to obtain short subgraphs
- Upgrading min-max spanning tree problem under various cost functions
- Guided inference of nested monotone Boolean functions
- Inverse combinatorial optimization: a survey on problems, methods, and results
- A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
- Eco-driving in urban traffic networks using traffic signals information
- A New Algorithm for Computing the Maximal Closure of a Graph
- Selected Applications of Minimum Cuts in Networks
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Edge Weight Reduction Problems in Directed Acyclic Graphs
- Minimizing a Convex Cost Closure Set
- An optimal polygonal boundary encoding scheme in the rate distortion sense
- Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A decision-making approach to reduce the margin of error of decision makers for bipolar soft set theory
This page was built for publication: Speedup the optimization of maximal closure of a node-weighted directed acyclic graph
