The \(S\)-digraph optimization problem and the greedy algorithm
From MaRDI portal
Publication:1019296
DOI10.1016/j.disopt.2005.08.004zbMath1176.90605OpenAlexW2062208409MaRDI QIDQ1019296
Publication date: 2 June 2009
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2005.08.004
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Greedoids
- An algorithm for the detection and construction of Monge sequences
- Code and parse trees for lossless source encoding
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Note on Independence Functions
- Dynamic huffman coding
- Design and analysis of dynamic Huffman codes
- Conditions for Optimality of the Huffman Algorithm
- On the Optimality of Huffman Trees
- Variations on a theme by Huffman
- The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
- A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER A FINITE JUMP SYSTEM
- A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
- A Method for the Construction of Minimum-Redundancy Codes
- Optimal assignments in an ordered set: An application of matroid theory
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Matroids and the greedy algorithm
This page was built for publication: The \(S\)-digraph optimization problem and the greedy algorithm
