Conference Proceedings
Home
 > 
Browse by Publisher
 > 
Schloss Dagstuhl
 > 
APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS. INTERNATIONAL CONFERENCE. 23RD 2020. (2 PARTS) (AND 24TH INTERNATIONAL CONFERENCE ON RANDOMIZATION AND COMPUTATION, RANDOM 2020)

APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS. INTERNATIONAL CONFERENCE. 23RD 2020. (2 PARTS) (AND 24TH INTERNATIONAL CONFERENCE ON RANDOMIZATION AND COMPUTATION, RANDOM 2020)

Send a Friend    
APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS. INTERNATIONAL CONFERENCE. 23RD 2020. (2 PARTS) (AND 24TH INTERNATIONAL CONFERENCE ON RANDOMIZATION AND COMPUTATION, RANDOM 2020)
Item #: 56219
Our Price:   
$165.00
Product Description
Title:23rd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 24th International Conference on Randomization and Computation (APPROX/RANDOM 2020): Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Desc:Proceedings of a meeting held 17-19 August 2020, Online.
Series:Leibniz International Proceedings in Informatics Volume 176
Editor:Byrka, J. et al.
ISBN:9781713818632
Pages:1,260 (2 Vols) (approx)
Format:Softcover
Publ:Schloss Dagstuhl
POD Publ:Curran Associates, Inc. ( Nov 2020 )
Related Products
Browse By PublisherShop By Category
Dave A Curran, EzineArticles.com Basic Author