0. 863-approximation algorithm for MAX DICUT

DOI10.1007/3-540-44666-4_17MaRDI QIDQ4780789zbMATH OpenFDO

Authors Shiro Matuura, Tomomi Matsui

Publication date 21 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2129/21290138

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT
• Approximation algorithm for MAX DICUT with given sizes of parts
• An approximation algorithm for MAX DICUT with given sizes of parts
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts

Cited in

(10)

• Simple approximation algorithms for balanced MAX~2SAT
• Approximation algorithm for MAX DICUT with given sizes of parts
• A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts
• NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT
• Online submodular maximization with preemption
• Fast Distributed Approximation for Max-Cut
• Adapting local sequential algorithms to the distributed setting
• Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
• scientific article; zbMATH DE number 7758361 (Why is no real title available?)
• Fault tolerant max-cut

This page was built for publication: 0. 863-approximation algorithm for MAX DICUT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780789)