rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Approximation Algorithms
  name:
    name part: Vazirani, Vijay V.
    role:
      role term: creator
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: Electronic books.
  origin info:
    place:
      place term: gw
    date issued: 2003
    issuance: monographic
  language:
    language term: eng
  physical description:
    reformatting quality: access
    form: remote
    extent: 1 online resource (xix, 380 pages)
  abstract: This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms. Richard Karp,University Professor, University of California at Berkeley Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer. It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms. László Lovász, Senior Researcher, Microsoft Research.
  table of contents: Introduction -- I. Combinatorial Algorithms: Set cover. Steiner tree and TSP. Multiway cuts and k-cuts. k-center. Feedback vertex set. Shortest superstring. Knapsack. Bin packing. Minimum makespan scheduling. Euclidean TSP -- II. LP-Based Algorithms: Introduction to LP-duality. Rounding applied to set cover. LP-duality based analysis for set cover. The primal-dual schema. Maximum satisfiability. Scheduling on unrelated parallel machines. Multicut and integer multicommodity flow in trees. Multiway cut. Multicut in general graphs. Sparsest cut. Steiner forest. Steiner network. Facility location. k-median. Semidefinite programming -- III. Other Topics: Counting problems. Shortest vector. Hardness of approximation. Open problems.
  note: by Vijay V. Vazirani.
  note: Electronic resource.
  subject:
    topic: Computer science
  subject:
    topic: Computer software
  subject:
    topic: Electronic data processing
  subject:
    topic: Computational complexity
  subject:
    topic: Combinatorial analysis
  subject:
    topic: Operations research
  subject:
    topic: Combinatorial analysis
  subject:
    topic: Computational complexity
  subject:
    topic: Computer science
  subject:
    topic: Computer software
  subject:
    topic: Electronic data processing
  subject:
    topic: Operations research
  classification: QA76.9.A43
  classification: 005.1
  identifier: 9783662045657 (electronic bk.)
  identifier: 3662045656 (electronic bk.)
  identifier: 9783642084690
  identifier: 3642084699
  identifier: 3662045656
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: AU@
    record creation date: 130125
    record change date: 20260420210839.7
    record identifier: in00003571068
    language of cataloging:
      language term: eng