Eran Halperin, Uri Zwick  Home/Search
Context Related
| cs.tau.ac.il/%7Ezw...bdicutSODA.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.tau.ac.il/~z...yonlinepapers (more) Homepages: U.Zwick |
Rate this article:      (best)Comment on this article |
Abstract: We describe several combinatorial algorithms for the maximum directed cut problem. Among our results is a simple linear time 9/20-approximation algorithm for the problem, and a somewhat slower 1/2-approximation algorithm that uses a bipartite matching routine. No better combinatorial approximation algorithms are known even for the easier maximum cut problem for undirected graphs. Our algorithms do not use linear programming, nor semidefinite programming. They are based on the observation that... (Update)
Context of citations to this paper: More
...rotation technique. As a related work, in SODA 2001, Halperin and Zwick proposed a combinatorial approximation algorithm for MAX DICUT [7]. In APPROX RANDOM 2001, authors proposed a randomized algorithm for MAX DICUT [10] In this paper, we propose an approximation algorithm...
Cited by: More
0.935-Approximation Randomized Algorithm for MAX 2SAT and its .. - Matuura, Matsui (2001) (Correct)
Active bibliography (related documents): More All
0.2: Finding Almost-Satisfying Assignments - Zwick (1997) (Correct)
0.2: Gadgets, Approximation, and Linear Programming (Extended.. - Trevsan, al. (Correct)
0.2: Approximation Algorithms for MaxSAT - Morales-Luna, Luna (1995) (Correct)
Similar documents based on text: More All
0.4: A 0.5-Approximation Algorithm For Max Dicut With Given.. - Ageev, Hassin.. (2000) (Correct)
0.3: An Approximation Algorithm for MAX DICUT with Given Sizes.. - Ageev, Hassin, Sviridenko (2000) (Correct)
0.3: Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (Correct)
BibTeX entry: (Update)
E. Halperin and U. Zwick, "Combinatorial Approximation Algorithms for the Maximum Directed Cut Problem", Proc. of 12thSODA, 1--7, 2001. http://citeseer.ist.psu.edu/halperin01combinatorial.html More
@inproceedings{ halperin01combinatorial,
author = "Eran Halperin and Uri Zwick",
title = "Combinatorial approximation algorithms for the maximum directed cut problem",
booktitle = "Symposium on Discrete Algorithms",
pages = "1-7",
year = "2001",
url = "citeseer.ist.psu.edu/halperin01combinatorial.html" }
Citations (may not include all citations):957 The probabilistic method (context) - Alon, Spencer - 1992
415 Improved approximation algorithms for maximum cut and satis .. - Goemans, Williamson - 1995
115 Approximating the value of two prover proof systems (context) - Feige, Goemans - 1995
83 On syntactic versus computational views of approximability - Khanna, Motwani et al. - 1994
71 Vertex packings: structural properties and algorithms (context) - Nemhauser, Trotter - 1975
69 Some optimal inapproximability results (context) - astad - 1997
56 and linear programming (context) - Trevisan, Sorkin et al. - 1996
26 Recycling queries in PCPs and in linearity tests (context) - Trevisan - 1998
13 algorithm for nding maximum matching in general graphs (context) - Micali, Vazirani et al. - 1980
11 Parallel approximation algorithms by positive linear program.. - Trevisan - 1998
9 North-Holland Publishing Co (context) - Lov, Plummer - 1986
8 Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorit.. - Zwick - 2000
6 Maximizing the number of unused colors in the vertex colorin.. (context) - Hassin, Lahav - 1994
4 New 3/4approximation algorithms for the maximum satis abilit.. (context) - Goemans, Williamson - 1994
1 Non-oblivious local search for MAX 2CCSP with application to.. (context) - Alimonti - 1997
1 Ecient approximation algorithms for semide nite programs ari.. (context) - Klein, Lu - 1996
Documents on the same site (http://www.cs.tau.ac.il/~zwick/my-online-papers.html): More
Which Patterns Are Hard to Find? - Cole, Hariharan, Paterson, Zwick (Correct)
Which Formulae Shrink under Random Restrictions? - Chockler, Zwick (Correct)
On the number of ANDs versus the number of ORs in monotone Boolean .. - Zwick (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC