Sciweavers

511 search results - page 92 / 103
» TSP with bounded metrics
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
ICAC
2009
IEEE
14 years 3 months ago
Self-correlating predictive information tracking for large-scale production systems
Automatic management of large-scale production systems requires a continuous monitoring service to keep track of the states of the managed system. However, it is challenging to ac...
Ying Zhao, Yongmin Tan, Zhenhuan Gong, Xiaohui Gu,...
SI3D
1999
ACM
14 years 23 days ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
JCB
2006
115views more  JCB 2006»
13 years 8 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
TWC
2008
113views more  TWC 2008»
13 years 8 months ago
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
Kai Zeng, Wenjing Lou, Hongqiang Zhai