Optimization Problems in Graph Theory

Name: Optimization Problems in Graph Theory
Brand: Springer Nature
SKU: 9783319948300
Availability: InStock

Best Price (Coupon Required):
Buy Optimization Problems in Graph Theory for $72.00 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $79.99 - $79.99

BEST PRICE

Single Product Purchase

$72.00

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$79.99	$79.99		10% OFF This deals requires coupon	$72.00		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783319948300

Condition

New

Product Description

This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutins fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: Algorithmic aspects of problems with disjoint cycles in graphs Graphs where maximal cliques and stable sets intersect The maximum independent set problem with special classes A general technique for heuristic algorithms for optimization problems The network design problem with cut constraints Algorithms for computing the frustration index of a signed graph A heuristic approach for studying the patrol problem on a graph Minimum possible sum and product of the proper connection number Structural and algorithmic results on branchings in digraphs Improved upper bounds for Korkel--Ghosh benchmark SPLP instances.

Available Colors

N/A

Available Sizes

N/A