• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Ljudböcker
  • Pocketböcker
  • Spel & pussel

Upp till 25% på utvalda nyheter →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Populära bokserier
    • Barnbokskaraktärer
    • Populära författare
    Logotyp för Bokus
    Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
    bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
    Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
    1. Naturvetenskap och teknik
    2. Matematik och naturvetenskap
    3. Matematik
    4. Optimering

    Combinatorial Optimization and Applications

    First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings

    AvAndreas Dress,Yinfeng Xu

    Häftad, Engelska, 2007

    Del i serien Lecture Notes in Computer Science

    543 kr

    Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

    Beskrivning

    Running to almost 400 pages, and featuring more than 40 papers, this work on combinatorial optimization and applications will be seen as an important addition to the literature. It constitutes the refereed proceedings of the first International Conference on Combinatorial Optimization and Applications, COCOA 2007, held in Xi'an, China in August of that year. The 29 revised full papers presented together with 8 invited papers and 2 invited presentations were carefully reviewed and selected from 114 submissions and cover both theoretical issues and practical applications.

    Produktinformation

    • Utgivningsdatum:2007-07-25
    • Mått:155 x 235 x 22 mm
    • Vikt:610 g
    • Format:Häftad
    • Språk:Engelska
    • Serie:Lecture Notes in Computer Science
    • Antal sidor:392
    • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
    • ISBN:9783540735557

    Utforska kategorier

    • Optimering inom Naturvetenskap och teknik

    Innehållsförteckning

    • Invited Lecture.- Matchings in Graphs Variations of the Problem.- Combinatorics from Bacterial Genomes.- Contributed Papers.- An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces.- Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes.- K-Connected Target Coverage Problem in Wireless Sensor Networks.- Searching Cycle-Disjoint Graphs.- An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan.- A New Dynamic Programming Algorithm for Multiple Sequence Alignment.- Energy Minimizing Vehicle Routing Problem.- On the On-Line k-Taxi Problem with Limited Look Ahead.- The Minimum Risk Spanning Tree Problem.- The Size of a Minimum Critically m-Neighbor-Scattered Graph.- A New Hybrid Algorithm for Feature Selection and Its Application to Customer Recognition.- Steiner Forests on Stochastic Metric Graphs.- On Threshold BDDs and the Optimal Variable Ordering Problem.- Communication Leading to Nash Equilibrium Through Robust Messages – S5-Knowledge Model Case –.- Fundamental Domains for Integer Programs with Symmetries.- Exact Algorithms for Generalized Combinatorial Optimization Problems.- Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders.- A Grid Resource Discovery Method Based on Adaptive k-Nearest Neighbors Clustering.- Algorithms for Minimum m-Connected k-Dominating Set Problem.- Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem.- Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp.- Mechanism Design by Creditability.- Infinite Families of Optimal Double-Loop Networks.- Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points.- An Experimental Study of Compressed Indexingand Local Alignments of DNA.- Secure Multiparty Computations Using the 15 Puzzle.- A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem.- Single Machine Common Due Window Scheduling with Controllable Job Processing Times.- A Lower Bound on Approximation Algorithms for the Closest Substring Problem.- A New Exact Algorithm for the Two-Sided Crossing Minimization Problem.- Improved Approximation Algorithm for Connected Facility Location Problems.- The Computational Complexity of Game Trees by Eigen-Distribution.- The Minimum All-Ones Problem for Graphs with Small Treewidth.- An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem.- Arc Searching Digraphs Without Jumping.- On the Complexity of Some Colorful Problems Parameterized by Treewidth.- A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model.