The S-digraph optimization problem and the greedy algorithm

DOI10.1016/J.DISOPT.2005.08.004zbMATH Open1176.90605OpenAlexW2062208409MaRDI QIDQ1019296FDOQ1019296

Authors: David Hartvigsen 

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

Recommendations

• On the Greedy Solution of Ordering Problems
• An Exact Characterization of Greedy Structures
• A greedy algorithm for maximizing a linear objective function
• A class of greedy algorithms and its relation to greedoids
• scientific article; zbMATH DE number 3904604

zbMATH Keywords

greedy algorithmdata compressionmatroidsHuffman codes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Introduction to algorithms
• Title not available (Why is that?)
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Title not available (Why is that?)
• A Method for the Construction of Minimum-Redundancy Codes
• 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
• The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
• Optimal assignments in an ordered set: An application of matroid theory
• An algorithm for the detection and construction of Monge sequences
• Dynamic huffman coding
• Design and analysis of dynamic Huffman codes
• Title not available (Why is that?)
• Variations on a theme by Huffman
• Greedoids
• Code and parse trees for lossless source encoding
• Title not available (Why is that?)
• Conditions for Optimality of the Huffman Algorithm
• On the Optimality of Huffman Trees
• A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
• Note on Independence Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER A FINITE JUMP SYSTEM

Cited In (5)

• Dijkstra's algorithm and L-concave function maximization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A class of greedy algorithms and its relation to greedoids

This page was built for publication: The \(S\)-digraph optimization problem and the greedy algorithm

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