Oskar-Bordeaux: envíos recientes
Mostrando ítems 2201-2220 de 96998
-
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Communication dans un congrès -
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
(Theoretical Computer Science. vol. 285, n° 1, pp. 3--24, 2002-08)Article de revue -
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
(Theoretical Computer Science. vol. 326, n° 1--3, pp. 137--153, 2004-10)Article de revue -
On k-Connectivity Problems with Sharpened Triangle Inequality
(Journal of Discrete Algorithms. vol. 6, n° 4, pp. 605--617, 2008)Article de revue -
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality (Extended Abstract)
Communication dans un congrès -
Improved approximation results for the Minimum Energy Broadcasting problem in Wireless Ad Hoc Networks
(Algorithmica. vol. 49, n° 4, pp. 318--336, 2007-12)Article de revue -
Improved approximation results for the Minimum Energy Broadcasting Problem
Communication dans un congrès -
Tightening the upper bound for the Minimum Energy Broadcasting
(Wireless Networks. vol. 14, n° 5, pp. 659--669, 2008)Article de revue -
Dominating Sets in Web Graphs
Communication dans un congrès -
Lower Bounds and Algorithms for Dominating Sets in Web Graphs
(Internet Mathematics. vol. 2, n° 3, pp. 275--300, 2005)Article de revue -
Searching for black-hole faults in a network using multiple agents
Communication dans un congrès -
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
(Springer-Verlag, 2005)Ouvrage -
Non-searchability of random power-law graphs
Communication dans un congrès -
Towards Small World Emergence
Communication dans un congrès -
Could any graph be turned into a small-world?
(Theoretical Computer Science. vol. 355, pp. 96--103, 2006)Article de revue -
From Balls and Bins to Points and Vertices
Communication dans un congrès -
Approximation bounds for Black Hole Search problems
Communication dans un congrès -
Hardness and approximation results for black hole search in arbitrary graphs
Communication dans un congrès -
Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the Minimum Energy Broadcast Routing Problem
Communication dans un congrès -
Hardness results and approximation algorithms of k-tuple domination in graphs
(Information Processing Letters. vol. 89, n° 2, pp. 75--83, 2004-01)Article de revue