Probabilistic Combinatorial Optimization Graphs by Murat Cécile (15 results)
- Hardcover
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 23.29
US$ 8.64 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: New. pp. 268 Illus.
- More images
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 140.68
US$ 2.64 shippingShips within U.S.A.Quantity: 20 available
Condition: New.
- Hardcover
Seller: INDOO, Avenel, NJ, U.S.A.INDOO
Contact seller5-star sellerCondition: New
US$ 143.33
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New. Brand New.
- More images
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 168.01
US$ 2.64 shippingShips within U.S.A.Quantity: 20 available
Condition: As New. Unread book in perfect condition.
Language: English
Published by ISTE Ltd and John Wiley & Sons Inc, London, 2006
- Hardcover
- First Edition
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contact seller5-star sellerCondition: New
US$ 188.99
Free ShippingShips within U.S.A.Quantity: 1 available
Hardcover. Condition: new. Hardcover. This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and… the minimum coloring. Those who possess a sound knowledge of the subject mater will find the title of great interest, but those who have only some mathematical familiarity and knowledge about complexity and approximation theory will also find it an accessible and informative read. This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 173.64
US$ 19.93 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
- More images
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 179.92
US$ 19.93 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 189.01
US$ 15.92 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: New. In.
- Hardcover
Seller: Ubiquity Trade, Miami, FL, U.S.A.Ubiquity Trade
Contact seller5-star sellerCondition: New
US$ 214.66
US$ 3.00 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New. Brand new! Please provide a physical shipping address.
- More images
Language: English
Published by ISTE Ltd and John Wiley and Sons Inc, GB, 2006
- Hardcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
US$ 230.66
Free ShippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardback. Condition: New. This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum… coloring. Those who possess a sound knowledge of the subject mater will find the title of great interest, but those who have only some mathematical familiarity and knowledge about complexity and approximation theory will also find it an accessible and informative read.
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 224.39
US$ 16.61 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: Brand New. 1st edition. 267 pages. 9.25x6.25x0.75 inches. In Stock.
- More images
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 208.24
US$ 71.37 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. Neuware - This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the m…inimum coloring. Those who possess a sound knowledge of the subject mater will find the title of great interest, but those who have only some mathematical familiarity and knowledge about complexity and approximation theory will also find it an accessible and informative read.
- More images
- Hardcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 222.01
US$ 79.70 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. Probabilistic Combinatorial Optimization on Graphs | Cécile Murat (u. a.) | Buch | Einband - fest (Hardcover) | Englisch | 2006 | Wiley | EAN 9781905209330 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.
- More images
Language: English
Published by ISTE Ltd and John Wiley and Sons Inc, GB, 2006
- Hardcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
US$ 223.37
US$ 86.36 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardback. Condition: New. This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum… coloring. Those who possess a sound knowledge of the subject mater will find the title of great interest, but those who have only some mathematical familiarity and knowledge about complexity and approximation theory will also find it an accessible and informative read.
Language: English
Published by ISTE Ltd and John Wiley & Sons Inc, London, 2006
- Hardcover
- First Edition
Seller: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contact seller5-star sellerCondition: New
US$ 300.95
US$ 37.00 shippingShips from Australia to U.S.A.Quantity: 1 available
Hardcover. Condition: new. Hardcover. This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and… the minimum coloring. Those who possess a sound knowledge of the subject mater will find the title of great interest, but those who have only some mathematical familiarity and knowledge about complexity and approximation theory will also find it an accessible and informative read. This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
