Scheduling data transfers in a network and the set scheduling problem

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 189-197

  Goel, Ashish ^a   Henzinger, Monika R ^a   Plotkin, Serge ^a   Tardos, Eva ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; CHANNEL CAPACITY; CONGESTION CONTROL (COMMUNICATION); CONSTRAINT THEORY; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; ONLINE SYSTEMS; OPTIMIZATION; POLYNOMIALS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

OFFLINE ALGORITHMS; ONLINE ALGORITHMS; POLY-LOGARITHMIC LOWER BOUNDS;

ALGORITHMS;

EID: 0032662399     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301250.301300     Document Type: Article

References (22)