On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing

Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science ◽

10.1007/11922377_7 ◽

2006 ◽

pp. 72-85 ◽

Cited By ~ 3

Author(s):

Michele Flammini ◽

Mordechai Shalom ◽

Shmuel Zaks

Download Full-text