Sciweavers

Share
GLOBECOM
2009
IEEE
8 years 11 months ago
Minimum-Length Scheduling for Multicast Traffic under Channel Uncertainty
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
Anna Pantelidou, Anthony Ephremides
CPC
2007
112views more  CPC 2007»
9 years 1 months ago
Graphs with Large Girth Not Embeddable in the Sphere
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...
Pierre Charbit, Stéphan Thomassé
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
9 years 3 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
books