2796 search results - page 119 / 560 » The coolest path problem |
128
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
129
click to vote
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
114
click to vote
IPL
2006
15 years 5 months ago
2006
We investigate the path model checking problem for the
186
click to vote
COMGEO
2012
ACM
14 years 21 days ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
139
click to vote
FTDCS
2003
IEEE
15 years 10 months ago
2003
IEEE
—Current multimedia application deployment tends to rely on composable service systems, where a complex multimedia service can be composed dynamically from multiple simpler ones ...