Sciweavers

824 search results - page 54 / 165
» Weighted Low-Rank Approximations
Sort
View
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
14 years 11 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
15 years 4 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
EUSFLAT
2007
125views Fuzzy Logic» more  EUSFLAT 2007»
14 years 11 months ago
On the Moments and the Distribution of the Choquet Integral
We investigate the distribution functions and the moments of the so-called Choquet integral, also known as the Lov´asz extension, when regarded as a real function of a random sam...
Ivan Kojadinovic, Jean-Luc Marichal
FOCS
2009
IEEE
15 years 4 months ago
Two-Message Quantum Interactive Proofs Are in PSPACE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
Rahul Jain, Sarvagya Upadhyay, John Watrous
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
15 years 1 months ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki