Work

Approximation Algorithms for NP-Hard Optimization Problems

Year: 2009

Type: book-chapter

Source: Chapman & Hall/CRC applied algorithms and data structures series

DOI: 10.1201/9781584888239-c34

Authors: Philip Klein, Neal Young

Institutions: Brown University, University of California System

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1790946027

FWCI: 1.081

Cites: 19

Cited by: 24

Related to: 10