( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Radio Aggregation Scheduling.

, , , , и . ALGOSENSORS, том 9536 из Lecture Notes in Computer Science, стр. 169-182. Springer, (2015)

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.

Rajiv Trehan

Rajiv Kumar

Vineet Gandhi

Hetvi Gandhi

Paneerselvam Rajiv

 

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

Improved Results for Data Migration and Open Shop Scheduling., , , и . ICALP, том 3142 из Lecture Notes in Computer Science, стр. 658-669. Springer, (2004)On Set Expansion Problems and the Small Set Expansion Conjecture., и . WG, том 8747 из Lecture Notes in Computer Science, стр. 189-200. Springer, (2014)Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria., , , и . WAOA, том 3351 из Lecture Notes in Computer Science, стр. 68-82. Springer, (2004)Approximation Algorithms for Channel Allocation Problems in Broadcast Networks., , , и . RANDOM-APPROX, том 2764 из Lecture Notes in Computer Science, стр. 47-58. Springer, (2003)Combinatorial Algorithms for Data Migration to Minimize Average Completion Time., и . APPROX-RANDOM, том 4110 из Lecture Notes in Computer Science, стр. 128-139. Springer, (2006)Sub-coloring and Hypo-coloring Interval Graphs., , , и . WG, том 5911 из Lecture Notes in Computer Science, стр. 122-132. (2009)Bicovering: Covering Edges With Two Small Subsets of Vertices., , , , и . ICALP, том 55 из LIPIcs, стр. 6:1-6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)An Improved Approximation Algorithm for Vertex Cover with Hard Capacities., , , , и . ICALP, том 2719 из Lecture Notes in Computer Science, стр. 164-175. Springer, (2003)An improved approximation algorithm for vertex cover with hard capacities., , , , и . J. Comput. Syst. Sci., 72 (1): 16-33 (2006)Approximation Algorithms for Partial Covering Problems., , и . ICALP, том 2076 из Lecture Notes in Computer Science, стр. 225-236. Springer, (2001)