|
Results
Found 17 publication records. Showing 17 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Guy E. Blelloch, Kanat Tangwongsan |
Parallel approximation algorithms for facility-location problems.  |
SPAA  |
2010 |
DBLP DOI BibTeX RDF |
parallel algorithms, approximation algorithms, facility location problems |
| 2 | Luca Trevisan |
Erratum: A Correction to "Parallel Approximation Algorithms by Positive Linear Programming".  |
Algorithmica  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy E. Blelloch, Kanat Tangwongsan |
Parallel Approximation Algorithms for Facility-Location Problems  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Christos Koufogiannakis, Neal E. Young |
Distributed and parallel algorithms for weighted vertex cover and other covering problems.  |
PODC  |
2009 |
DBLP DOI BibTeX RDF |
distributed covering, distributed vertex cover |
| 1 | Ryuhei Uehara, Zhi-Zhong Chen |
Parallel approximation algorithms for maximum weighted matching in general graphs.  |
Inf. Process. Lett.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryuhei Uehara, Zhi-Zhong Chen |
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs.  |
IFIP TCS  |
2000 |
DBLP DOI BibTeX RDF |
parallel algorithm, approximation algorithm, Graph algorithm, maximum weighted matching |
| 1 | Luca Trevisan |
Parallel Approximation Algorithms by Positive Linear Programming.  |
Algorithmica  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria J. Serna, Luca Trevisan, Fatos Xhafa |
The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming.  |
STACS  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Keqin Li |
Solving the Traveling Salesman Problem Using Efficient Randomized Parallel Approximation Algorithms.  |
Parallel Algorithms Appl.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria J. Serna, Fatos Xhafa |
The Parallel Approximability of a Subclass of Quadratic Programming. (PDF / PS)  |
ICPADS  |
1997 |
DBLP DOI BibTeX RDF |
Parallel Approximation Algorithms, De-randomization, Quadratic Programming, Randomized Rounding |
| 1 | Luca Trevisan |
Positive Linear Programming, Parallel Approximation and PCP's.  |
ESA  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Li |
Randomized Parallel Approximation Algorithms for the Traveling Salesman Problem.  |
Parallel and Distributed Computing and Systems  |
1995 |
DBLP BibTeX RDF |
|
| 1 | Zhi-Zhong Chen |
NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings.  |
ICALP  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander 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.  |
ISAAC  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Sridhar Rajagopalan, Vijay V. Vazirani |
Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs  |
FOCS  |
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 |
| 1 | Richard J. Anderson, Ernst W. Mayr, Manfred K. Warmuth |
Parallel Approximation Algorithms for Bin Packing  |
Inf. Comput.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernst W. Mayr |
Parallel Approximation Algorithms.  |
FGCS  |
1988 |
DBLP BibTeX RDF |
|
Displaying result #1 - #17 of 17 (100 per page; Change: )
|