The proceedings of the January 1995 symposium, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics, comprise 70 papers. Among the topics: on-line approximate list indexing with applications; finding subsets maximizing minimum structures; register allocation in structured programs; and splay trees for data compression. No index. Annotation copyright by Book News, Inc., Portland, OROur characterization tests a vector for membership in a graphic polymatroid by solving one network flow problem (i.e., a minimum s, t-cut problem) and one minimum t-cut problem. This characterization leads to different parametric problems inanbsp;...
|Title||:||Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms|
|Publisher||:||SIAM - 1995-01-01|