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

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

4.11 - 1251 ratings - Source

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
Author:
Publisher:SIAM - 2003-01-01
ISBN-13:

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

How it works:
  • 1. Register a free 1 month Trial Account.
  • 2. Download as many books as you like (Personal use)
  • 3. Cancel the membership at any time if not satisfied.


Click button below to register and download Ebook
Privacy Policy | Contact | DMCA