MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Approximating k." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1,894 documents found, showing 1 through 10. Next 10 →

ATOM

Approximating the k-multicut problem
by Daniel Golovin, Viswanath Nagarajan, Mohit Singh — 2006 — In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms
…Approximating the k-Multicut Problem Daniel Golovin ∗ Viswanath Nagarajan † Mohit Singh ‡ October…
Cited by 7 (0 self) – Add To MetaCart

On the complexity of approximating k-set packing
by Elad Hazan, Shmuel Safra, Oded Schwartz — 2003 — Proc. of APPROX
…On the Complexity of Approximating k-Set Packing Elad Hazan ∗ Shmuel Safra † Oded Schwartz…
Cited by 6 (0 self) – Add To MetaCart

Approximating k-spanner problems for k > 2
by Michael Elkin, David Peleg — 2001 — In Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization
…Approximating k-Spanner Problems for k > 2 Michael Elkin ∗ David Peleg † January 13, 2005 Abstract…
Cited by 2 (0 self) – Add To MetaCart

On the Hardness of Approximating k-Dimensional Matching
by Hazan Safra And, E. Hazan, S. Safra, O. Schwartz
…On the Hardness of Approximating k-Dimensional Matching E. Hazan # S. Safra # and O. Schwartz…
Add To MetaCart

Approximating k-outconnected Subgraph Problems
by Joseph Cheriyan, Tibor Jordán, Zeev Nutov — 1998 — in Lecture Notes in Comput. Sci
…Approximating k-outconnected Subgraph Problems Joseph Cheriyan 1 , Tibor Jord'an 2 , and Zeev…
Cited by 3 (0 self) – Add To MetaCart

Iterative approximation of k-limited polling systems
by M. Van Vuuren, E. M. M. Win — 2006
…Iterative approximation of k-limited polling systems M. van Vuuren 1,∗ and E.M.M. Winands 1,2,† 1…
Cited by 2 (0 self) – Add To MetaCart

Approximating k-median with non-uniform capacities
by Julia Chuzhoy, Yuval Rabani — 2005 — In SODA ’05
…Approximating k-Median with Non-Uniform Capacities Julia Chuzhoy ∗ Yuval Rabani † Abstract…
Cited by 5 (0 self) – Add To MetaCart

Approximating k-cuts using Network Strength as a Lagrangean Relaxation
by R. Ravi, Amitabh Sinha
…Approximating k-cuts using Network Strength as a Lagrangean Relaxation R. Ravi Tepper School…
Cited by 1 (0 self) – Add To MetaCart

The labeled cell classifier: a fast approximation to k nearest neighbors
by Ro M. Palau — 1998 — Proc. 14th Int. Conf. Pattern Recognition
…The labeled cell classifier: a fast approximation to k nearest neighbors ∗ Alessandro M. Palau…
Cited by 2 (0 self) – Add To MetaCart

Approximating k-means-type clustering via semidefinite programming
by Jiming Peng, Yu Wei — SIAM Journal on Optimization
…Approximating K-means-type clustering via semidefinite programming Jiming Peng Yu Wei ∗ May 16…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB