Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Civil infrastructure provides the range of essential services generally necessary to support a nation’s economy and quality of life—arguably entire economies rely on the abili...
The peer-to-peer (P2P) model generally requires that bidirectional and direct communications for contentdelivery be set up between user peers after discovery of the desired conten...
Tetsuya Oh-ishi, Koji Sakai, Tetsuya Iwata, Akira ...
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...