LIBRISTO
LIBROAMANTO
obvezno
Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun
0
Brezplačna dostava Zásilkovna nad 69.99 €
Zbirna točka GLS 4.49 Zbirna točka DPD 2.99 Kurirska služba GLS 5.49 Kurir DPD 3.49 Kurirska služba 3.49 Zbirno mesto 3.49 Zbirno mesto 3.49 Dostava preko Pošte Slovenije 3.49

Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

Approximation Algorithms for Combinatorial Optimization

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

Jezik AngleščinaAngleščina
Knjiga Mehka
Knjiga Approximation Algorithms for Combinatorial Optimization Klaus Jansen
Koda Libristo: 50454482
Založba Springer Nature B.V., marec 2014
Search and Classification of High Dimensional Data.- Bicriteria Spanning Tree Problems.- Improved Ap... Celoten opis
? points 138 b
56.95
Na zalogi pri dobavitelju Odposlali bomo v 10-18 dneh

30 dni za vračilo blaga

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.

Igralka & Poliglotka
EWA KASP za
Predvajaj video
Ewa Kasp
Libristo ima največjo izbiro tujejezične literature. Zato svoje knjige kupujem tukaj.

O knjigi

Polni naslov Approximation Algorithms for Combinatorial Optimization
Jezik Angleščina
Vezava Knjiga - Mehka
Datum izida 2014
Število strani 284
EAN 9783662164297
ISBN 3662164299
Koda Libristo 50454482
Teža 403
Mere 156 x 234 x 15
Podarite to knjigo še danes
To je povsem preprosto
1 Dodajte knjigo v košarico in izberite dostavo kot darilo 2 V zameno vam bomo poslali kupon 3 Knjiga bo dostavljena na naslov obdarovanca

Prijava

Prijavite se v svoj račun. Še nimate računa Libristo? Ustvarite ga zdaj!

 
obvezno
obvezno

Še nimate računa? Izkoristite prednosti računa Libristo!

Z računom Libristo boste imeli vedno vse pod nadzorom.

Ustvarite račun Libristo