From the January 2003 symposium come just over 100 papers addressing a range of topics related to discrete algorithms. Examples of topics covered include packing Steiner trees, counting inversions in lists, directed scale-free graphs, quantum property testing, and improved results for directed multicut. The papers were not formally refereed, but attempts were made to verify major results. Annotation (c)2003 Book News, Inc., Portland, OR (booknews.com)Formally, we are given a signal A 6 RN and a dictionary a#39;1) = {Ac, ~}, -EI of unit vectors that span RN . ... NJ 07932 USA, {agilbert, muthu, mstrauss}0research.att. com are amenable to our algorithms) and yet have significantly large sizes, thereby ... We have presented algorithmic results for some of the most basic problems in this area, but other mathematical and algorithmic questions remain to be explored.

Title | : | Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms |

Author | : | |

Publisher | : | SIAM - 2003-01-01 |

Continue