104 search results - page 12 / 21 » On an Online Spanning Tree Problem in Randomly Weighted Grap... |
131
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
136
click to vote
ESA
2009
Springer
16 years 15 days ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
171
click to vote
LATIN
2010
Springer
16 years 23 days ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
195
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
Hierarchical models are commonly used to organize a Website's content. A Website's content structure can be represented by a topic hierarchy, a directed tree rooted at a...
145
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...