2796 search results - page 191 / 560 » The coolest path problem |
158
click to vote
ICTAI
2007
IEEE
16 years 25 days ago
2007
IEEE
We propose a novel and efficient solution to the problem of clustering XML documents based on their structure. We use operations on multisets of paths of document trees to define...
167
click to vote
PAM
2007
Springer
16 years 20 days ago
2007
Springer
Most Internet measurement studies utilize traceroute-collected path traces to build Internet maps. In this paper, we measure the impact of alias resolution problem on Internet topo...
206
click to vote
APPROX
2004
Springer
15 years 12 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
156
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
169
click to vote
TON
2002
15 years 6 months ago
2002
Multiconstrained quality-of-service (QoS) routing deals with finding routes that satisfy multiple independent QoS constraints. This problem is NP-hard. In this paper, two heuristic...