The S-digraph optimization problem and the greedy algorithm

Authors:
David Hartvigsen
Affiliations:
Mendoza College of Business, University of Notre Dame, Notre Dame, IN 46556-5646, USA
Venue:
Discrete Optimization
Year:
2005

Citing 11
Cited 0

Dynamic Huffman coding

Journal of Algorithms
Design and analysis of dynamic Huffman codes

Journal of the ACM (JACM)
Elements of information theory

Elements of information theory
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees

SIAM Journal on Computing
Introduction to algorithms

Introduction to algorithms
Discrete and Combinatoral Mathematics: An Applied Introduction 2nd Ed.

Discrete and Combinatoral Mathematics: An Applied Introduction 2nd Ed.
Combinatorial Algorithms

Combinatorial Algorithms
A greedy algorithm for maximizing a linear objective function

Discrete Applied Mathematics
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs

IEEE Transactions on Information Theory
Variations on a theme by Huffman

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new optimization problem and a general class of objective functions for this problem. We show that optimal solutions to this problem with these objective functions are found with a simple greedy algorithm. Special cases include matroids, Huffman's data compression problem, a special class of greedoids, a special class of min cost max flow problems (related to Monge sequences), a special class of weighted f-factor problems, and some new problems.