LIBRISTO
LIBROAMANTO
mandatory
Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free
0
DPD courier 4.99 GLS courier 9.99

Approximation Algorithms for Combinatorial Optimization

5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings

Language EnglishEnglish
Book Paperback
Book Approximation Algorithms for Combinatorial Optimization Klaus Jansen
Libristo code: 50454482
Publishers Springer Nature B.V., March 2014
Search and Classification of High Dimensional Data.- Bicriteria Spanning Tree Problems.- Improved Ap... Full description
? points 145 b
59.71
In stock at our supplier Shipping in 10-18 days

Up to 30 days for returns

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.

Actress & Polyglot
EWA KASP for
Play video
Ewa Kasp
Libristo has the largest selection of foreign-language books. That’s why I buy my books there.

About the book

Full name Approximation Algorithms for Combinatorial Optimization
Language English
Binding Book - Paperback
Date of issue 2014
Number of pages 284
EAN 9783662164297
ISBN 3662164299
Libristo code 50454482
Weight 403
Dimensions 156 x 234 x 15
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's address

Login

Log in to your account. Don't have a Libristo account? Create one now!

 
mandatory
mandatory

Don’t have an account? Discover the benefits of having a Libristo account!

With a Libristo account, you'll have everything under control.

Create a Libristo account