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)The O-extension problem is also a special case of the metric labeling problem studied by Kleinberg and Tardos [KT99]. ... We give a polynomial time algorithm that takes a fractional solution to the linear programming relaxation, and rounds it toanbsp;...
|Title||:||Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms|
|Publisher||:||SIAM - 2003-01-01|