Name: Approximation Algorithms for Combinatorial Optimization. Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (en Inglés)
SKU: 67386891
Price: 75.90 USD
Availability: InStock
Author: Klaus Jansen;Samir Khuller

portada Approximation Algorithms for Combinatorial Optimization. Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (en Inglés)

Approximation Algorithms for Combinatorial Optimization. Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Klaus Jansen;Samir Khuller

Año

2014

Idioma

Inglés

N° páginas

292

Encuadernación

Tapa Blanda

Dimensiones

23.4x15.6x1.5 cm

ISBN13

9783662188859

Approximation Algorithms for Combinatorial Optimization. Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (en Inglés)

Klaus Jansen;Samir Khuller (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 16 a 23 días háb.

$ 138.01$ 75.90

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 75.90

Llega entre el 11 Sep y el 24 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Approximation Algorithms for Combinatorial Optimization. Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (en Inglés)"

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.