Approximation Algorithms for Combinatorial Optimization
Subtitle: International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings (Lecture Notes in Computer Science)
Contributors: Klaus Jansen (Editor); Jose Rolim (Editor)
Edition: 1 edition
Publisher: Springer
Published: August 13, 1998
Language: eng
Format: Paperback
Number of pages: 201
ISBN-13: 9783540647362
Subjects: Mathematical theory of computation; Discrete Mathematics; Computer algorithms; Science/Mathematics; Algorithms (Computer Programming); Computers; Computers - Languages / Programming; Data processing; Congresses; Computer Science; Programming - General; Approximation Algorithms; Complexity Classes; Computers / Computer Science; Graph Computations; Approximation Theory; Computer Graphics - General; Combinatorial optimization
First sentence: The independent set problem is that of finding a maximum size set of mutually non-adjacent vertices in a graph.