824 search results - page 30 / 165 » Weighted Low-Rank Approximations |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...
JDA
2006
13 years 8 months ago
2006
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
MOC
2002
13 years 8 months ago
2002
This paper considers the n-point Gauss-Jacobi approximation of nonsingular integrals of the form 1 -1
STOC
2001
ACM
14 years 8 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
COCOA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...