Sciweavers

824 search results - page 19 / 165
» Weighted Low-Rank Approximations
Sort
View
SODA
1998
ACM
128views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
Sanjeev Arora, Michelangelo Grigni, David R. Karge...
CDC
2010
IEEE
13 years 3 months ago
Stochastic approximation for consensus with general time-varying weight matrices
This paper considers consensus problems with delayed noisy measurements, and stochastic approximation is used to achieve mean square consensus. For stochastic approximation based c...
Minyi Huang
WG
2005
Springer
14 years 1 months ago
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...
ISAAC
2001
Springer
99views Algorithms» more  ISAAC 2001»
14 years 27 days ago
Tree-Approximations for the Weighted Cost-Distance Problem
Christian Schindelhauer, Birgitta Weber