Skip to content
Library Home
Start Over
Research Databases
E-Journals
Course Reserves
Library Home
Login to library account
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文(繁體)
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Language
Library Catalog
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Find
Advanced Search
|
Browse
|
Search Tips
Approximation Algorithms for C...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Approximation Algorithms for Combinatorial Optimization Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings / edited by Klaus Jansen, Samir Khuller.
Saved in:
Bibliographic Details
Corporate Author:
SpringerLink (Online service)
Other Authors:
Jansen, Klaus
(Editor)
,
Khuller, Samir
(Editor)
Format:
eBook
Language:
English
Published:
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2000.
Edition:
1st ed. 2000.
Series:
Lecture Notes in Computer Science,
1913
Springer eBook Collection.
Subjects:
Computer programming.
Data structures (Computer science).
Application software.
Algorithms.
Computer graphics.
Electronic resources (E-books)
Online Access:
Click to view e-book
Holy Cross Note:
Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Holdings
Description
Table of Contents
Similar Items
Staff View
Table of 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.
Similar Items
Algorithms - ESA 2000 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings
Published: (2000)
Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,Berkeley, CA, USA, August 8-11, 1999 Pro
Published: (1999)
Algorithm Engineering and Experimentation International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers
Published: (1999)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings
Published: (2011)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings
Published: (2010)