Greedy approximation algorithms for directed multicuts

Yana Kortsarts; Guy Kortsarz; Zeev Nutov

doi:10.1002/net.20066

Greedy approximation algorithms for directed multicuts

Networks ◽

10.1002/net.20066 ◽

2005 ◽

Vol 45 (4) ◽

pp. 214-217 ◽

Cited By ~ 5

Author(s):

Yana Kortsarts ◽

Guy Kortsarz ◽

Zeev Nutov

Keyword(s):

Approximation Algorithms ◽

Greedy Approximation

Greedy Approximation Algorithms

Encyclopedia of Algorithms ◽

10.1007/978-3-642-27848-8_174-2 ◽

2014 ◽

pp. 1-7

Author(s):

Weili Wu ◽

Feng Wang

Keyword(s):

Approximation Algorithms ◽

Greedy Approximation

Greedy Approximation Algorithms, 2004; Ruan, Du, Jia, Wu, Li, Ko

10.1007/springerreference_57693 ◽

2011 ◽

Keyword(s):

Approximation Algorithms ◽

Greedy Approximation

On greedy approximation algorithms for a class of two-stage stochastic assignment problems

Optimization Methods and Software ◽

10.1080/10556788.2012.728216 ◽

2012 ◽

Vol 29 (1) ◽

pp. 42-67 ◽

Cited By ~ 1

Author(s):

Serdar Karademir ◽

Nan Kong ◽

Oleg A. Prokopyev

Keyword(s):

Approximation Algorithms ◽

Assignment Problems ◽

Two Stage ◽

Greedy Approximation ◽

Stochastic Assignment

Fast decoding of regular LDPC codes using greedy approximation algorithms

2011 IEEE International Symposium on Information Theory Proceedings ◽

10.1109/isit.2011.6033906 ◽

2011 ◽

Author(s):

Nicholas Kalouptsidis ◽

Nicholas Kolokotronis

Keyword(s):

Approximation Algorithms ◽

Ldpc Codes ◽

Greedy Approximation ◽

Fast Decoding

On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 ◽

10.1145/1060590.1060656 ◽

2005 ◽

Cited By ~ 3

Author(s):

Abraham D. Flaxman ◽

Alan M. Frieze ◽

Juan C. Vera

Keyword(s):

Approximation Algorithms ◽

Facility Location ◽

Location Problem ◽

Facility Location Problem ◽

Average Case ◽

Uncapacitated Facility Location Problem ◽

Greedy Approximation

Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks

Computational Geometry and Graphs - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45281-9_13 ◽

2013 ◽

pp. 132-142

Author(s):

Yusuke Nojima ◽

Yasuhito Asano ◽

Masatoshi Yoshikawa

Keyword(s):

Approximation Algorithms ◽

Flow Problem ◽

Relation Extraction ◽

Maximum Flow ◽

Information Networks ◽

Greedy Approximation ◽

Maximum Flow Problem

On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem

Combinatorics Probability Computing ◽

10.1017/s096354830600798x ◽

2006 ◽

Vol 16 (05) ◽

pp. 713 ◽

Cited By ~ 1

Author(s):

ABRAHAM D. FLAXMAN ◽

ALAN M. FRIEZE ◽

JUAN CARLOS VERA

Keyword(s):

Approximation Algorithms ◽

Facility Location ◽

Location Problem ◽

Facility Location Problem ◽

Average Case ◽

Uncapacitated Facility Location Problem ◽

Greedy Approximation

Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-44543-4_26 ◽

2016 ◽

pp. 334-346 ◽

Cited By ~ 1

Author(s):

Markus Chimani ◽

Ivo Hedtke ◽

Tilo Wiedera

Keyword(s):

Approximation Algorithms ◽

Greedy Approximation

Greedy Approximation Algorithms

Encyclopedia of Algorithms ◽

10.1007/978-1-4939-2864-4_174 ◽

2016 ◽

pp. 882-886

Author(s):

Weili Wu ◽

Feng Wang

Keyword(s):

Approximation Algorithms ◽

Greedy Approximation

Greedy Approximation Algorithms

Encyclopedia of Algorithms ◽

10.1007/978-0-387-30162-4_174 ◽

2008 ◽

pp. 376-379

Author(s):

Feng Wang ◽

Weili Wu

Keyword(s):

Approximation Algorithms ◽

Greedy Approximation