182 search results - page 15 / 37 » Routing Tree Problems on Random Graphs |
124
click to vote
JCIT
2008
14 years 11 months ago
2008
Multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication which includes application such as multipoint data dissemination and m...
102
click to vote
COR
2000
14 years 11 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
105
click to vote
SODA
2001
ACM
15 years 18 days ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
102
click to vote
SPAA
2004
ACM
15 years 4 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
112
click to vote
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...