Order Total (1 Item Items):
Shipping Destination:
Probabilistic Combinatorial Optimization Graphs by Murat Cécile (13 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (13)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (11)
- As New, Fine or Near Fine (2)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (13)
- Softcover (No further results match this refinement)
Collectible Attributes
- First Edition (2)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (5)
- Not Print on Demand (13)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
-
Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
-
Condition: New. pp. 268 Illus.
-
Condition: New.
-
Condition: New. Brand New.
-
Condition: As New. Unread book in perfect condition.
-
Probabilistic Combinatorial Optimization on Graphs (Hardcover)
Language: English
Published by ISTE Ltd and John Wiley & Sons Inc, London, 2006
ISBN 10: 1905209339 ISBN 13: 9781905209330
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.
-
Probabilistic Combinatorial Optimization on Graphs
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 129.31
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Condition: New. Brand new! Please provide a physical shipping address.
-
Probabilistic Combinatorial Optimization on Graphs
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 155.79
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
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 ve.
-
Probabilistic Combinatorial Optimization on Graphs (Hardcover)
Language: English
Published by ISTE Ltd and John Wiley & Sons Inc, London, 2006
ISBN 10: 1905209339 ISBN 13: 9781905209330
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.
