4526 search results - page 3 / 906 » Algorithmic problems related to the Internet |
NETCOOP
2009
Springer
14 years 2 months ago
2009
Springer
There are moves in the Internet architecture community to add multipath capabilities to TCP, so that end-systems will be able to shift their traffic away from congested parts of th...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
CAV
1994
Springer
13 years 11 months ago
1994
Springer
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design ...
TPDS
1998
13 years 7 months ago
1998
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...