Approximation Algorithms For Combinatorial Optimization 5th International Worksh

674,00 DKK
+ 169,49 DKK Levering

Approximation Algorithms For Combinatorial Optimization 5th International Worksh

Sоlgt af:
  • product image

674,00 DKK

På lager
+ 169,49 DKK Levering

14-dages returpolitik

Køberbeskyttelse

Betalingsmetoder:

Produktdetaljer

Produktdetaljer

Approximation Algorithms For Combinatorial Optimization 5th International Worksh

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 2726-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 2log 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.
  • Brand: Springer Nature B.V
  • Kategori: Computer og internet
  • Format: Paperback
  • Forlag / Pladeselskab: Springer Nature B.V
  • Udgivelsesdato: 2014-03-12
  • Forfatter: Springer Nature B.V
  • Sprog: English
  • Antal sider: 284
  • Fruugo ID: 557251567-1125521430
  • ISBN: 9783662164297
Løfte

Sælgergaranti

2 års juridisk garanti inkluderet

Dine EU-forbrugerrettigheder inkluderer en gratis minimum 2 års juridisk garanti

Download juridisk overensstemmelsesgaranti
Levering

Levering

Sendes inden for 24 timer

  • STANDARD: 216,20 DKK - Levering mellem kl man. 16 november 2026–ons. 18 november 2026

Afsendes fra Storbritannien.

Returnering

Returnering og afbestilling

Returnering

Vi gør vores bedste for at sikre, at de produkter, du bestiller, leveres til dig fuldt ud og i henhold til dine specifikationer. Skulle du dog modtage en ufuldstændig ordre eller andre ting end dem, du bestilte, eller der er en anden grund til, at du ikke er tilfreds med ordren, kan du returnere ordren eller produkter inkluderet i ordren og modtage en fuld refusion for varerne.

Se fuld returpolitik

Afbestillinger

Du har ret til at fortryde dit køb inden for 14 dage efter modtagelse af din ordre uden at angive en grund. For nemt at udøve din ret kan du bruge linket "Annuller min ordre" i sidefoden på hver side eller på din Fruugo-konto under "Ordrer". Når du har udøvet din fortrydelsesret, sender vi dig en e-mailbekræftelse. Hvis din ordre allerede er blevet sendt af forhandleren, giver vi dig de nødvendige returinstruktioner for at sikre, at din refusion behandles hurtigt.

Se den fulde afbestillingspolitik