Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Approximation and Online Algorithms
Improving communication-phase completion times in HPC clusters through congestion mitigation
SYSTOR '09 Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference
Greening backbone networks: reducing energy consumption by shutting off cables in bundled links
Proceedings of the first ACM SIGCOMM workshop on Green networking
ElasticTree: saving energy in data center networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Minimizing Routing Energy Consumption: From Theoretical to Practical Results
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Identifying and using energy-critical paths
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Course timetabling using evolutionary operators
Applied Soft Computing
Iolaus: securing online content rating systems
Proceedings of the 22nd international conference on World Wide Web
Segregating event streams and noise with a Markov renewal process model
The Journal of Machine Learning Research
| Hi-index | 0.00 |
A very primitive version of Gotlieb's timetable problem is shown to be NP-complete, and therefore all the common timetable problems are NP-complete. A polynomial time algorithm, in case all teachers are binary, is shown. The theorem that a meeting function always exists if all teachers and classes have no time constraints is proved. The multi-commodity integral flow problem is shown to be NP-complete even if the number of commodities is two. This is true both in the directed and undirected cases. Finally, the two commodity real flow problem in undirected graphs is shown to be solvable in polynomial time. The time bound is O(|v|2|E|).