Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase constant-time approximation algorithms (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2004-2012 (8)
Publication types (Num. hits)
article(3) inproceedings(5)
Venues (Conferences, Journals, ...)
STOC(2) COLT(1) CoRR(1) Electronic Colloquium on Compu...(1) FOCS(1) Machine Learning(1) TAMC(1)
Authors
Yuichi Yoshida(5) Hiro Ito(2) Shai Ben-David(2) Huy N. Nguyen(1) Krzysztof Onak(1) Masaki Yamamoto(1) Susumu Kiyoshima(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 5 keywords
Results
Found 8 publication records. Showing 8 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida Constant-Time Approximation Algorithms for the Knapsack Problem. Search on Bibsonomy TAMC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yuichi Yoshida Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yuichi Yoshida Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree CSP. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Yuichi Yoshida Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree CSP Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Yuichi Yoshida, Masaki Yamamoto, Hiro Ito An improved constant-time approximation algorithm for maximum~matchings. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover
1Huy N. Nguyen, Krzysztof Onak Constant-Time Approximation Algorithms via Local Improvements. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Shai Ben-David A framework for statistical clustering with constant time approximation algorithms for K-median and K-means clustering. Search on Bibsonomy Machine Learning The full citation details ... 2007 DBLP  DOI  BibTeX  RDF k-median clustering, Sample-based clustering, Description schemes, Approximation algorithms, k-means clustering
1Shai Ben-David A Framework for Statistical Clustering with a Constant Time Approximation Algorithms for K-Median Clustering. Search on Bibsonomy COLT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #8 of 8 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.