Approximation Algorithms for Combinatorial Optimization [electronic resource] : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings /

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.

Saved in:
Bibliographic Details
Main Authors: Jansen, Klaus. editor., Khuller, Samir. editor., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2000
Subjects:Computer science., Computer programming., Data structures (Computer science)., Algorithms., Computer graphics., Application software., Computer Science., Programming Techniques., Data Structures, Cryptology and Information Theory., Computer Applications., Algorithm Analysis and Problem Complexity., Data Structures., Computer Graphics.,
Online Access:http://dx.doi.org/10.1007/3-540-44436-X
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:209896
record_format koha
spelling KOHA-OAI-TEST:2098962018-07-30T23:41:57ZApproximation Algorithms for Combinatorial Optimization [electronic resource] : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings / Jansen, Klaus. editor. Khuller, Samir. editor. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg,2000.engInvited 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.Computer science.Computer programming.Data structures (Computer science).Algorithms.Computer graphics.Application software.Computer Science.Programming Techniques.Data Structures, Cryptology and Information Theory.Computer Applications.Algorithm Analysis and Problem Complexity.Data Structures.Computer Graphics.Springer eBookshttp://dx.doi.org/10.1007/3-540-44436-XURN:ISBN:9783540444367
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Computer science.
Computer programming.
Data structures (Computer science).
Algorithms.
Computer graphics.
Application software.
Computer Science.
Programming Techniques.
Data Structures, Cryptology and Information Theory.
Computer Applications.
Algorithm Analysis and Problem Complexity.
Data Structures.
Computer Graphics.
Computer science.
Computer programming.
Data structures (Computer science).
Algorithms.
Computer graphics.
Application software.
Computer Science.
Programming Techniques.
Data Structures, Cryptology and Information Theory.
Computer Applications.
Algorithm Analysis and Problem Complexity.
Data Structures.
Computer Graphics.
spellingShingle Computer science.
Computer programming.
Data structures (Computer science).
Algorithms.
Computer graphics.
Application software.
Computer Science.
Programming Techniques.
Data Structures, Cryptology and Information Theory.
Computer Applications.
Algorithm Analysis and Problem Complexity.
Data Structures.
Computer Graphics.
Computer science.
Computer programming.
Data structures (Computer science).
Algorithms.
Computer graphics.
Application software.
Computer Science.
Programming Techniques.
Data Structures, Cryptology and Information Theory.
Computer Applications.
Algorithm Analysis and Problem Complexity.
Data Structures.
Computer Graphics.
Jansen, Klaus. editor.
Khuller, Samir. editor.
SpringerLink (Online service)
Approximation Algorithms for Combinatorial Optimization [electronic resource] : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings /
description 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.
format Texto
topic_facet Computer science.
Computer programming.
Data structures (Computer science).
Algorithms.
Computer graphics.
Application software.
Computer Science.
Programming Techniques.
Data Structures, Cryptology and Information Theory.
Computer Applications.
Algorithm Analysis and Problem Complexity.
Data Structures.
Computer Graphics.
author Jansen, Klaus. editor.
Khuller, Samir. editor.
SpringerLink (Online service)
author_facet Jansen, Klaus. editor.
Khuller, Samir. editor.
SpringerLink (Online service)
author_sort Jansen, Klaus. editor.
title Approximation Algorithms for Combinatorial Optimization [electronic resource] : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings /
title_short Approximation Algorithms for Combinatorial Optimization [electronic resource] : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings /
title_full Approximation Algorithms for Combinatorial Optimization [electronic resource] : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings /
title_fullStr Approximation Algorithms for Combinatorial Optimization [electronic resource] : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings /
title_full_unstemmed Approximation Algorithms for Combinatorial Optimization [electronic resource] : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings /
title_sort approximation algorithms for combinatorial optimization [electronic resource] : third international workshop, approx 2000 saarbrücken, germany, september 5–8, 2000 proceedings /
publisher Berlin, Heidelberg : Springer Berlin Heidelberg,
publishDate 2000
url http://dx.doi.org/10.1007/3-540-44436-X
work_keys_str_mv AT jansenklauseditor approximationalgorithmsforcombinatorialoptimizationelectronicresourcethirdinternationalworkshopapprox2000saarbruckengermanyseptember582000proceedings
AT khullersamireditor approximationalgorithmsforcombinatorialoptimizationelectronicresourcethirdinternationalworkshopapprox2000saarbruckengermanyseptember582000proceedings
AT springerlinkonlineservice approximationalgorithmsforcombinatorialoptimizationelectronicresourcethirdinternationalworkshopapprox2000saarbruckengermanyseptember582000proceedings
_version_ 1756268721862606848