Sciweavers

434 search results - page 22 / 87
» Improved Algorithms for the 2-Vertex Disjoint Paths Problem
Sort
View
FUIN
2000
68views more  FUIN 2000»
14 years 9 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
VTC
2008
IEEE
239views Communications» more  VTC 2008»
15 years 3 months ago
Cross-Layer and Path Priority Scheduling Based Real-Time Video Communications over Wireless Sensor Networks
—This paper addresses the problem of real-time video streaming over a bandwidth and energy constrained wireless sensor network (WSN). Considering the compressed video bit stream ...
Min Chen, Victor C. M. Leung, Shiwen Mao, Ming Li
CCCG
2010
14 years 11 months ago
The traveling salesman problem for lines and rays in the plane
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
Adrian Dumitrescu
SWAT
2004
Springer
146views Algorithms» more  SWAT 2004»
15 years 2 months ago
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
Gerth Stølting Brodal, Rolf Fagerberg, Ulri...
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
15 years 6 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...