Coverart for item
The Resource Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings, Klaus Jansen, Samir Khuller (eds.)

Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings, Klaus Jansen, Samir Khuller (eds.)

Label
Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings
Title
Approximation algorithms for combinatorial optimization
Title remainder
third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings
Statement of responsibility
Klaus Jansen, Samir Khuller (eds.)
Creator
Contributor
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2000, held in Saarbrcken, Germany in September 2000. The 22 revised full papers presented together with four invited contributions were carefully reviewed and selected from 68 submissions. The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications
Member of
Cataloging source
COO
Dewey number
004/.01/5114
Illustrations
illustrations
Index
index present
Language note
English
LC call number
QA76.9.A43
LC item number
W67 2000
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2000
http://bibfra.me/vocab/lite/meetingName
International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Jansen, Klaus
  • Khuller, Samir
Series statement
Lecture notes in computer science
Series volume
1913
http://library.link/vocab/subjectName
  • Computer algorithms
  • Approximation theory
  • Combinatorial optimization
  • Algorithmes
  • Approximation, Théorie de l'
  • Optimisation combinatoire
  • Approximation theory
  • Combinatorial optimization
  • Computer algorithms
  • Approximation
  • Kombinatorische Optimierung
  • Kongress
  • Algoritmen
  • Numerieke methoden
  • Benaderingen (wiskunde)
  • Optimaliseren
  • Combinatorische meetkunde
  • Algoritmos e estruturas de dados
  • Matematica da computacao
  • Aproximacao (analise numerica)
  • Algorithmes
  • Optimisation combinatoire
  • Approximation, Théorie de l'
Label
Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings, Klaus Jansen, Samir Khuller (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Invited Talks -- Approximation Algorithms That Take Advice -- Instant Recognition of Polynomial Time Solvability, Half Integrality, and 2-Approximations -- Scheduling under Uncertainty: Optimizing against a Randomizing Adversary -- Approximation Algorithms for Facility Location Problems -- Contributed Talks -- An Approximation Algorithm for MAX DICUT with Given Sizes of Parts -- Maximizing Job Benefits On-Line -- Variable Length Sequencing with Two Lengths -- Randomized Path Coloring on Binary Trees -- Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem -- Greedy Approximation Algorithms for Finding Dense Components in a Graph -- Online Real-Time Preemptive Scheduling of Jobs with Deadlines -- On the Relative Complexity of Approximate Counting Problems -- On the Hardness of Approximating NP Witnesses -- Maximum Dispersion and Geometric Maximum Weight Cliques -- New Results for Online Page Replication -- Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses -- Approximation Algorithms for a Capacitated Network Design Problem -- An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem -- Improved Approximations for Tour and Tree Covers -- Approximating Node Connectivity Problems via Set Covers -- Rectangle Tiling -- Primal-Dual Approaches to the Steiner Problem -- On the Inapproximability of Broadcasting Time -- Polynomial Time Approximation Schemes for Class-Constrained Packing Problems -- Partial Servicing of On-Line Jobs -- Factor 4/3 Approximations for Minimum 2-Connected Subgraphs
Control code
619593507
Dimensions
unknown
Extent
1 online resource (ix, 273 pages)
Form of item
online
Isbn
9783540679967
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 9783540679967
  • 10.1007/3-540-44436-X
Other physical details
illustrations.
Specific material designation
remote
System control number
(OCoLC)619593507
Label
Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings, Klaus Jansen, Samir Khuller (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Invited Talks -- Approximation Algorithms That Take Advice -- Instant Recognition of Polynomial Time Solvability, Half Integrality, and 2-Approximations -- Scheduling under Uncertainty: Optimizing against a Randomizing Adversary -- Approximation Algorithms for Facility Location Problems -- Contributed Talks -- An Approximation Algorithm for MAX DICUT with Given Sizes of Parts -- Maximizing Job Benefits On-Line -- Variable Length Sequencing with Two Lengths -- Randomized Path Coloring on Binary Trees -- Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem -- Greedy Approximation Algorithms for Finding Dense Components in a Graph -- Online Real-Time Preemptive Scheduling of Jobs with Deadlines -- On the Relative Complexity of Approximate Counting Problems -- On the Hardness of Approximating NP Witnesses -- Maximum Dispersion and Geometric Maximum Weight Cliques -- New Results for Online Page Replication -- Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses -- Approximation Algorithms for a Capacitated Network Design Problem -- An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem -- Improved Approximations for Tour and Tree Covers -- Approximating Node Connectivity Problems via Set Covers -- Rectangle Tiling -- Primal-Dual Approaches to the Steiner Problem -- On the Inapproximability of Broadcasting Time -- Polynomial Time Approximation Schemes for Class-Constrained Packing Problems -- Partial Servicing of On-Line Jobs -- Factor 4/3 Approximations for Minimum 2-Connected Subgraphs
Control code
619593507
Dimensions
unknown
Extent
1 online resource (ix, 273 pages)
Form of item
online
Isbn
9783540679967
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 9783540679967
  • 10.1007/3-540-44436-X
Other physical details
illustrations.
Specific material designation
remote
System control number
(OCoLC)619593507

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...