Experimental and Efficient Algorithms
Subtitle: Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings (Lecture Notes in Computer Science)
Contributors: Klaus Jansen (Editor); Marian Margraf (Editor); Monaldo Mastrolilli (Editor); José D. P. Rolim (Editor)
Edition: 1 edition
Publisher: Springer
Published: August 5, 2003
Language: eng
Format: Paperback
Number of pages: 267
ISBN-13: 9783540402053
Subjects: Applied mathematics; Programming - General; Computers - Languages / Programming; Computer Science; Computers; Language; General; Congresses; Discrete Mathematics; Computers / Computer Science; algorithmic mathematics; algorithmics; algorithms; combinatorial mathematics; combinatorial optimization; computational geometry; computational graph theory; efficient algorithms; experimental algorithms; Computer algorithms
First sentence: In combinatorial optimization many algorithms are based (explicitly or implicitly) on linear programming approaches.