Bokus

Vijay V. Vazirani – författare

Visar alla böcker från författaren Vijay V. Vazirani. Handla med fri frakt och snabb leverans.

5 produkter

  1. Vijay V. Vazirani - Approximation Algorithms, Inbunden. Tillgänglighet: Lägg i varukorg

    Approximation Algorithms

    Av Vijay V. Vazirani

    Inbunden, 2001

    1011 kr

    Lägg i varukorg

    Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P≠NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial-time …

  2. Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani - Algorithmic Game Theory, Inbunden. Tillgänglighet: Lägg i varukorg

    Algorithmic Game Theory

    Av Noam Nisan, Tim Roughgarden m. fl.

    Inbunden, 2007

    1074 kr

    Lägg i varukorg

    In recent years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. Algorithmic Game Theory, first published in 2007, develops the central ideas and results of this exciting area in a clear and succinct manner. More than 40 of the top …

  3. Federico Echenique, Nicole Immorlica, Vijay V. Vazirani - Online and Matching-Based Market Design, Inbunden. Tillgänglighet: Lägg i varukorg

    Online and Matching-Based Market Design

    Av Federico Echenique, Nicole Immorlica m. fl.

    Inbunden, 2023

    940 kr

    Lägg i varukorg

    The rich, multi-faceted and multi-disciplinary field of matching-based market design is an active and important one due to its highly successful applications with economic and sociological impact. Its home is economics, but with intimate connections to algorithm design and operations research. With …

  4. Vijay V. Vazirani - Approximation Algorithms, Häftad. Tillgänglighet: Lägg i varukorg

    Approximation Algorithms

    Av Vijay V. Vazirani

    Häftad, 2010

    716 kr

    Lägg i varukorg

    Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P≠NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial-time …

  5. Vijay V. Vazirani - Approximation Algorithms, E-bok. Tillgänglighet: Lägg i varukorg

    Approximation Algorithms

    Av Vijay V. Vazirani

    E-bok, 2013

    929 kr

    Lägg i varukorg

    Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P≠NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial-time …