2137 search results - page 113 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
161
click to vote
SADM
2008
15 years 4 months ago
2008
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
157
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
135
click to vote
DAM
1999
15 years 4 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
144
Voted
STOC
1998
ACM
15 years 9 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
137
click to vote
WEA
2007
Springer
15 years 11 months ago
2007
Springer
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...