909 search results - page 144 / 182 » On the approximability of some network design problems |
112
click to vote
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. There has been growing interest in developing nonlinear dimensionality reduction algorithms for vision applications. Although progress has been made in recent years, conv...
109
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
SODA
2007
ACM
15 years 2 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
110
click to vote
ICDE
2011
IEEE
14 years 5 months ago
2011
IEEE
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
107
click to vote
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...