60 search results - page 10 / 12 » Complexity of some inverse shortest path lengths problems |
121
click to vote
ICDCS
1999
IEEE
15 years 5 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
184
Voted
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
120
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
111
Voted
INFOCOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
127
click to vote
CCCG
2008
15 years 2 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...