Matthew Andrews

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
General dynamic routing with per-packet delay guarantees of \(O (\mathrm{distance} + 1 / \mathrm{session\ rate})\)2026-05-21Paper
Source routing and scheduling in packet networks2026-05-08Paper
Minimum-cost network design with (dis)economies of scale2025-04-29Paper
Approximation algorithms for the edge-disjoint paths problem via Raecke decompositions2025-04-29Paper
Improved bounds for on-line load balancing
Lecture Notes in Computer Science
2024-01-29Paper
A simple molecular mathematical model of mammalian hibernation
Journal of Theoretical Biology
2021-01-21Paper
Capacitated metric labeling2017-09-29Paper
Packet routing with arbitrary end-to-end delay requirements
Proceedings of the thirty-first annual ACM symposium on Theory of Computing
2016-09-29Paper
Minimum-cost network design with (dis)economies of scale
SIAM Journal on Computing
2016-01-20Paper
Logarithmic hardness of the undirected edge-disjoint paths problem
Journal of the ACM
2015-12-04Paper
Almost-tight hardness of directed congestion minimization
Journal of the ACM
2015-11-11Paper
Routing and scheduling in multihop wireless networks with time-varying channels2015-08-03Paper
scientific article; zbMATH DE number 6381648 (Why is no real title available?)2014-12-18Paper
Logarithmic hardness of the directed congestion minimization problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
2014-11-25Paper
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
ACM Transactions on Algorithms
2014-11-18Paper
Rate-adaptive weighted fair queueing for energy-aware scheduling
Information Processing Letters
2014-04-15Paper
Routing and scheduling for energy and delay minimization in the powerdown model
Networks
2013-08-06Paper
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
Combinatorica
2011-12-19Paper
Hardness of the undirected edge-disjoint paths problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
2010-08-16Paper
Hardness of the undirected congestion minimization problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
2010-08-16Paper
Routing and scheduling in multihop wireless networks with time-varying channels
ACM Transactions on Algorithms
2010-08-14Paper
scientific article; zbMATH DE number 5485447 (Why is no real title available?)2009-01-05Paper
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data
Journal of the ACM
2008-12-21Paper
Hardness of the Undirected Congestion Minimization Problem
SIAM Journal on Computing
2008-03-28Paper
Scheduling protocols for switches with large envelopes
Journal of Scheduling
2007-12-20Paper
A survey of scheduling theory in wireless data networks2007-11-05Paper


Research outcomes over time


This page was built for person: Matthew Andrews