|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 7 keywords
|
|
|
|
|
Results
Found 7 publication records. Showing 7 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
Directed multicut, hardness of approximation, sparsest cut |
| 2 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow |
| 2 | Julia Chuzhoy, Sanjeev Khanna |
Hardness of cut problems in directed graphs. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
directed multicut, hardness of approximation, sparsest cut |
| 2 | Anupam Gupta |
Improved results for directed multicut. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Agarwal, Noga Alon, Moses Charikar |
Improved approximation for directed cut problems. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
directed multicut, directed sparsest cut, approximation algorithm, linear programming relaxation |
| 1 | Yana Kortsarts, Guy Kortsarz, Zeev Nutov |
Approximation Algorithm for Directed Multicuts. |
WAOA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael E. Saks, Alex Samorodnitsky, Leonid Zosin |
A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C20, 90C35, 90B10 |
Displaying result #1 - #7 of 7 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")