From post

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.

 

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

Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times., , и . ACiD, том 7 из Texts in Algorithmics, стр. 85-94. King's College, London, (2006)Probabilistic Greedy Heuristics for Satisfiability Problems., и . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)Representational Flexibility for Design., и . AID, стр. 105-128. Springer, (2002)The capacitated max k -cut problem., , и . Math. Program., 115 (1): 65-72 (2008)Metric View Planning Problem with Traveling Cost and Visibility Range., , и . ICRA, стр. 1292-1297. IEEE, (2007)Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem., , и . ESA, том 1879 из Lecture Notes in Computer Science, стр. 211-219. Springer, (2000)Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System., , и . CALDAM, том 10156 из Lecture Notes in Computer Science, стр. 107-117. Springer, (2017)Streaming scalable video over WiMAX networks., , и . IWQoS, стр. 1-9. IEEE, (2010)An Efficient Heuristic Scheme for Dynamic Remapping of Parallel Computations., , и . Parallel Comput., 19 (6): 621-632 (1993)Average performance of greedy heuristics for the integer knapsack problem., , и . Eur. J. Oper. Res., 154 (1): 36-45 (2004)