Author of the publication

Hardness and approximation of Gathering in static radio networks.

, , , , and . PerCom Workshops, page 75-79. IEEE Computer Society, (2006)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the asymptotic behavior of nearest neighbor search using pivot-based indexes., and . SISAP, page 33-39. ACM, (2010)On the complexity of bandwidth allocation in radio networks., , and . Theor. Comput. Sci., 406 (3): 225-239 (2008)Aggregation heuristic for the open-pit block scheduling problem., , , , and . Eur. J. Oper. Res., 249 (3): 1169-1177 (2016)Hardness and Approximation of Gathering in Static Radio Networks., , , , and . Parallel Process. Lett., 16 (2): 165-184 (2006)Hardness and approximation of Gathering in static radio networks., , , , and . PerCom Workshops, page 75-79. IEEE Computer Society, (2006)A new model for automated pushback selection., , and . Comput. Oper. Res., (2020)A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: An application to the open-pit mine block sequencing problem., , and . Eur. J. Oper. Res., 303 (3): 1088-1099 (2022)Gathering Radio Messages in the Path., , , , and . Discret. Math. Algorithms Appl., (2013)Antithetic random fields applied to mine planning under uncertainty., , and . Comput. Geosci., (2018)An efficient method for optimizing nested open pits with operational bottom space., , and . Int. Trans. Oper. Res., 31 (3): 1609-1630 (May 2024)