Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Max-Dicut (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1995 (2) 1997 (2) 2000 (1) 2001 (2)
Publication types (Num. hits)
article(1) inproceedings(6)
Venues (Conferences, Journals, ...)
WG(2) APPROX(1) FOCS(1) ISTCS(1) RANDOM-APPROX(1) SIAM J. Discrete Math.(1)
Authors
Alexander A. Ageev(2) Maxim Sviridenko(2) Refael Hassin(2) David P. Williamson(1) Michel X. Goemans(1) Paola Alimonti(1) Ramesh Hariharan(1) Sanjeev Mahajan(1) Shiro Matuura(1) Tomomi Matsui(1) Uriel Feige(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 10 occurrences of 10 keywords
Results
Found 7 publication records. Showing 7 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
2Shiro Matuura, Tomomi Matsui 63-Approximation Algorithm for MAX DICUT. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
2Alexander A. Ageev, Refael Hassin, Maxim Sviridenko An approximation algorithm for MAX DICUT with given sizes of parts. Search on Bibsonomy APPROX The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Refael Hassin, Maxim Sviridenko A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Paola Alimonti Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT. Search on Bibsonomy WG The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1David P. Williamson Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). Search on Bibsonomy WG The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Uriel Feige, Michel X. Goemans Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. Search on Bibsonomy ISTCS The full citation details ... 1995 DBLP  BibTeX  RDF
1Sanjeev Mahajan, Ramesh Hariharan Derandomizing Semidefinite Programming Based Approximation Algorithms. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat
Displaying result #1 - #7 of 7 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.