The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1988-2009 (15) 2010 (2)
Publication types (Num. hits)
article(6) inproceedings(11)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11 occurrences of 9 keywords

Results
Found 17 publication records. Showing 17 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2Guy E. Blelloch, Kanat Tangwongsan Parallel approximation algorithms for facility-location problems. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF parallel algorithms, approximation algorithms, facility location problems
2Luca Trevisan Erratum: A Correction to "Parallel Approximation Algorithms by Positive Linear Programming". Search on Bibsonomy Algorithmica The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Guy E. Blelloch, Kanat Tangwongsan Parallel Approximation Algorithms for Facility-Location Problems Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Christos Koufogiannakis, Neal E. Young Distributed and parallel algorithms for weighted vertex cover and other covering problems. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF distributed covering, distributed vertex cover
1Ryuhei Uehara, Zhi-Zhong Chen Parallel approximation algorithms for maximum weighted matching in general graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Ryuhei Uehara, Zhi-Zhong Chen Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. Search on Bibsonomy IFIP TCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF parallel algorithm, approximation algorithm, Graph algorithm, maximum weighted matching
1Luca Trevisan Parallel Approximation Algorithms by Positive Linear Programming. Search on Bibsonomy Algorithmica The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Maria J. Serna, Luca Trevisan, Fatos Xhafa The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming. Search on Bibsonomy STACS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Keqin Li Solving the Traveling Salesman Problem Using Efficient Randomized Parallel Approximation Algorithms. Search on Bibsonomy Parallel Algorithms Appl. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Maria J. Serna, Fatos Xhafa The Parallel Approximability of a Subclass of Quadratic Programming. (PDF / PS) Search on Bibsonomy ICPADS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Parallel Approximation Algorithms, De-randomization, Quadratic Programming, Randomized Rounding
1Luca Trevisan Positive Linear Programming, Parallel Approximation and PCP's. Search on Bibsonomy ESA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Kevin Li Randomized Parallel Approximation Algorithms for the Traveling Salesman Problem. Search on Bibsonomy Parallel and Distributed Computing and Systems The full citation details ... 1995 DBLP  BibTeX  RDF
1Zhi-Zhong Chen NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings. Search on Bibsonomy ICALP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim The Parallel Complexity of Approximating the High Degree Subgraph Problem. Search on Bibsonomy ISAAC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Sridhar Rajagopalan, Vijay V. Vazirani Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF randomized voting, primal-dual RNC approximation algorithms, covering integer programs, classical greedy sequential set cover algorithm, parallel approximation algorithms, randomization, set cover problem
1Richard J. Anderson, Ernst W. Mayr, Manfred K. Warmuth Parallel Approximation Algorithms for Bin Packing Search on Bibsonomy Inf. Comput. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Ernst W. Mayr Parallel Approximation Algorithms. Search on Bibsonomy FGCS The full citation details ... 1988 DBLP  BibTeX  RDF
Displaying result #1 - #17 of 17 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.