7930 search results - page 136 / 1586 » Greedy in Approximation Algorithms |
176
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
143
click to vote
ICDIM
2008
IEEE
16 years 24 days ago
2008
IEEE
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
173
click to vote
IPCO
1993
15 years 7 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
164
click to vote
CAGD
1999
15 years 6 months ago
1999
By its dual representation, a developable surface can be viewed as a curve of dual projective 3-space. After introducing an appropriate metric in the dual space and restricting ou...
190
click to vote
OL
2010
15 years 1 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...