From post

Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance.

, , , и . FAW-AAIM, том 7285 из Lecture Notes in Computer Science, стр. 26-35. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem., , , , , , , и . FAW, том 11458 из Lecture Notes in Computer Science, стр. 14-25. Springer, (2019)Approximation algorithms for the three-machine proportionate mixed shop scheduling., , , , , , , , , и . Theor. Comput. Sci., (2020)Inverse minimum flow problem under the weighted sum-type Hamming distance., , и . Discret. Appl. Math., (2017)Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance., , , и . FAW-AAIM, том 7285 из Lecture Notes in Computer Science, стр. 26-35. Springer, (2012)Improved approximation algorithms for two-stage flexible flow shop scheduling., , и . J. Comb. Optim., 41 (1): 28-42 (2021)Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop., , , , , , и . AAIM, том 11343 из Lecture Notes in Computer Science, стр. 268-280. Springer, (2018)Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost., , , , и . Inf. Sci., (2014)Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph., , , , , , и . COCOON, том 10976 из Lecture Notes in Computer Science, стр. 205-217. Springer, (2018)Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance., и . ESCAPE, том 4614 из Lecture Notes in Computer Science, стр. 375-383. Springer, (2007)Inverse Maximum Flow Problems under the Combining Norms.. FAW-AAIM, том 7924 из Lecture Notes in Computer Science, стр. 221-230. Springer, (2013)