Condition: New. pp. 268 Illus.
Condition: New.
Seller: INDOO, Avenel, NJ, U.S.A.
Condition: New. Brand New.
Condition: As New. Unread book in perfect condition.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 126.88
Quantity: Over 20 available
Add to basketCondition: New.
Language: English
Published by ISTE Ltd and John Wiley & Sons Inc, London, 2006
ISBN 10: 1905209339 ISBN 13: 9781905209330
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
First Edition
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.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 131.14
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In.
Condition: New. Brand new! Please provide a physical shipping address.
Language: English
Published by ISTE Ltd and John Wiley and Sons Inc, GB, 2006
ISBN 10: 1905209339 ISBN 13: 9781905209330
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
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/Hermes Science Pub, 2006
ISBN 10: 1905209339 ISBN 13: 9781905209330
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 1st edition. 267 pages. 9.25x6.25x0.75 inches. In Stock.
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 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.
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.
Language: English
Published by ISTE Ltd and John Wiley and Sons Inc, GB, 2006
ISBN 10: 1905209339 ISBN 13: 9781905209330
Seller: Rarewaves.com UK, London, United Kingdom
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
ISBN 10: 1905209339 ISBN 13: 9781905209330
Seller: AussieBookSeller, Truganina, VIC, Australia
First Edition
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.