Del i serien Lecture Notes in Computer Science

Approximation Algorithms for Combinatorial Optimization

International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings

Häftad, Engelska, 1998

AvKlaus Jansen,Jose Rolim

739 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (2)

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998.The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability 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.

Produktinformation

Utgivningsdatum1998-07-01
Mått155 x 235 x 12 mm
Vikt335 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor207
Upplaga1998
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540647362

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

Approximations of independent sets in graphs.- Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems.- The Steiner tree problem and its generalizations.- Approximation schemes for covering and scheduling in related machines.- One for the price of two: A unified approach for approximating covering problems.- Approximation of geometric dispersion problems.- Approximating k-outconnected subgraph problems.- Lower bounds for on-line scheduling with precedence constraints on identical machines.- Instant recognition of half integrality and 2-approximations.- The t-vertex cover problem: Extending the half integrality framework with budget constraints.- A new fully polynomial approximation scheme for the knapsack problem.- On the hardness of approximating spanners.- Approximating circular arc colouring and bandwidth allocation in all-optical ring networks.- Approximating maximum independent set in k-clique-free graphs.- Approximating an interval scheduling problem.- Finding dense subgraphs with semidefinite programming.- Best possible approximation algorithm for MAX SAT with cardinality constraint.

Mer från samma författare

Del 14292

Fundamentals of Computation Theory

Henning Fernau, Klaus Jansen

Häftad, 2023

1 179 kr

Approximative Algorithmen und Nichtapproximierbarkeit

Klaus Jansen, Marian Margraf

Inbunden, 2008

869 kr

Del 10138

Approximation and Online Algorithms

Klaus Jansen, Monaldo Mastrolilli

Häftad, 2017

719 kr

Approximation and Online Algorithms

Klaus Jansen, Roberto Solis-Oba

Häftad, 2004

739 kr

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron

Häftad, 2004

739 kr

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Chandra Chekuri, Klaus Jansen, José D.P. Rolim, Luca Trevisan

Häftad, 2005

719 kr

Efficient Approximation and Online Algorithms

Evripidis Bampis, Klaus Jansen, Claire Kenyon

Häftad, 2006

739 kr

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Josep Diaz, Klaus Jansen, José D.P. Rolim, Uri Zwick

Häftad, 2006

739 kr

Experimental and Efficient Algorithms

Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim

Häftad, 2003

719 kr

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai

Häftad, 2003

719 kr

Mer från samma serie

Compiler Construction

Albert Cohen

Häftad, 2014

709 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

739 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

739 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

739 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 209 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

739 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Häftad, 2025

959 kr

Del 16625

Web Engineering

Andrea Mauri, Lola Burgueño, Riccardo Tommasini

Häftad, 2026

1 099 kr

Du kanske också är intresserad av

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Maria Serna, Ronen Shaltiel, Klaus Jansen, José Rolim

Häftad, 2010

1 479 kr

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Ashish Goel, Klaus Jansen, José Rolim, Ronitt Rubinfeld

Häftad, 2008

1 479 kr

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim

Häftad, 2009

1 479 kr

Randomization and Approximation Techniques in Computer Science

Michael G. Luby, Jose D. P. Rolim, Michael Luby, Jose Rolim, Maria Serna

Häftad, 1998

739 kr

Algorithmic Aspects of Wireless Sensor Networks

Sotiris Nikoletseas, Jose Rolim

Häftad, 2004

739 kr

Parallel Algorithms for Irregularly Structured Problems

Alfonso Ferreira, Jose Rolim, Yousef Saad, Tao Yang

Häftad, 1996

739 kr

Solving Irregularly Structured Problems in Parallel

Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, Jose Rolim

Häftad, 1997

739 kr

Parallel and Distributed Processing

Jose Rolim

Häftad, 1998

1 479 kr

Handbook of Randomized Computing

Sanguthevar Rajasekaran, Panos M. Pardalos, J.H. Reif, José Rolim

Häftad, 2013

719 kr

Parallel Algorithms for Irregular Problems: State of the Art

Alfonso Ferreira, José Rolim

Häftad, 2010

2 209 kr

Del i serien Lecture Notes in Computer Science

Approximation Algorithms for Combinatorial Optimization

International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings

Häftad, Engelska, 1998

AvKlaus Jansen,Jose Rolim

739 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (2)

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum1998-07-01
Mått155 x 235 x 12 mm
Vikt335 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor207
Upplaga1998
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540647362

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

Approximations of independent sets in graphs.- Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems.- The Steiner tree problem and its generalizations.- Approximation schemes for covering and scheduling in related machines.- One for the price of two: A unified approach for approximating covering problems.- Approximation of geometric dispersion problems.- Approximating k-outconnected subgraph problems.- Lower bounds for on-line scheduling with precedence constraints on identical machines.- Instant recognition of half integrality and 2-approximations.- The t-vertex cover problem: Extending the half integrality framework with budget constraints.- A new fully polynomial approximation scheme for the knapsack problem.- On the hardness of approximating spanners.- Approximating circular arc colouring and bandwidth allocation in all-optical ring networks.- Approximating maximum independent set in k-clique-free graphs.- Approximating an interval scheduling problem.- Finding dense subgraphs with semidefinite programming.- Best possible approximation algorithm for MAX SAT with cardinality constraint.