20807 search results - page 4162 / 4162 » How to read a paper |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
ADT
2011
12 years 9 months ago
2011
Currently, there is a strong effort of the research community in rethinking the Internet architecture to cope with its current limitations and support new requirements. Many resea...