Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
Recent technological advances have opened up a wide range of distributed real-time applications involving battery-driven embedded devices with local processing and wireless communi...
G. Sudha Anil Kumar, Govindarasu Manimaran, Zhengd...
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduc...
Yu Wang 0003, Weizhao Wang, Xiang-Yang Li, Wen-Zha...
Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within a narrow range of operating conditions. This rigid design re...
Many-to-one matching markets exist in numerous different forms, such as college admissions, matching medical interns to hospitals for residencies, assigning housing to college st...
Elizabeth Bodine-Baron, Christina Lee, Anthony Cho...