Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings

ISBN 10: 3662164299 ISBN 13: 9783662164297

Edit� par Springer, 2014

Neuf(s) Couverture souple

Vendeur Ria Christie Collections, Uxbridge, Royaume-Uni �valuation du vendeur 5 sur 5 �toiles

Vendeur AbeBooks depuis 25 mars 2015

Nous sommes d�sol�s, cet exemplaire n'est plus disponible. Voici les r�sultats qui se rapprochent le plus pour Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings.

Afficher tous les articles du vendeur Cr�er une demande de livres portant sur des articles similaires

Afficher tous les exemplaires de ce livre

A propos de cet article

In. N� de r�f. du vendeur ria9783662164297_new

Signaler cet article

Synopsis :

Search and Classification of High Dimensional Data.- Bicriteria Spanning Tree Problems.- Improved Approximation Algorithms for Multilevel Facility Location Problems.- On Constrained Hypergraph Coloring and Scheduling.- On the Power of Priority Algorithms for Facility Location and Set Cover.- Two Approximation Algorithms for 3-Cycle Covers.- Approximation Algorithms for the Unsplittable Flow Problem.- 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.- Typical Rounding Problems.- Approximating Min-sum Set Cover.- Approximating Maximum Edge Coloring in Multigraphs.- Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees.- A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs.- Facility Location and the Geometric Minimum-Diameter Spanning Tree.- Improved Approximation Algorithms for the Partial Vertex Cover Problem.- Minimum Restricted Diameter Spanning Trees.- Hardness of Approximation for Vertex-Connectivity Network-Design Problems.- Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \[ 2^{\log } ^{^{_{^{1 - \in } } } } ^n \] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.- Routing and Admission Control in Networks with Advance Reservations.- Improved Approximation Algorithms for Metric Facility Location Problems.- Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products.- Primal-Dual Algorithms for Connected Facility Location Problems.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

D�tails bibliographiques

Titre : Approximation Algorithms for Combinatorial ...
�diteur : Springer
Date d'�dition : 2014
Reliure : Couverture souple
Etat : New

Meilleurs r�sultats de recherche sur AbeBooks

Image d'archives

Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 Proceedings

Jansen, Klaus ; Leonardi, Stefano ; Vazirani, Vijay

Edit� par Springer Verlag, New York City, 2002

ISBN 10 : 3540441867 ISBN 13 : 9783540441861

Ancien ou d'occasion Couverture rigide

Vendeur : Doss-Haus Books, Redondo Beach, CA, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Hardcover. Etat : Very Good. No Jacket. Hardcover 2002 library bound edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Laminated covers and text in very good to near fine condition. Series: Lecture Notes in Computer Science ;2462. [viii, 269 p. : ill. ; 24 cm]. N� de r�f. du vendeur 010678

Contacter le vendeur

Acheter D'occasion

EUR 36,26

EUR 4,69 shipping
Exp�dition nationale�: Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Approximation Algorithms for Combinatorial Optimization | 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings

Klaus Jansen (u. a.)

Edit� par Springer, 2002

ISBN 10 : 3540441867 ISBN 13 : 9783540441861

Neuf Taschenbuch

Vendeur : preigu, Osnabr�ck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Contacter le vendeur

Acheter neuf

EUR 50,35

EUR 70 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 5 disponible(s)

Ajouter au panier

Image d'archives

Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings (Lecture Notes in Computer Science, 2462)

Edit� par Springer, 2002

ISBN 10 : 3540441867 ISBN 13 : 9783540441861

Neuf Couverture souple

Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Etat : New. N� de r�f. du vendeur ABLIING23Mar3113020167889

Contacter le vendeur

Acheter neuf

EUR 52,35

EUR 3,41 shipping
Exp�dition nationale�: Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings

Klaus Jansen

Edit� par Springer Berlin Heidelberg, 2002

ISBN 10 : 3540441867 ISBN 13 : 9783540441861

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e cient approximate solutions to computationally d- cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications. The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R. N� de r�f. du vendeur 9783540441861

Contacter le vendeur