SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-94776-1_57 ◽

2018 ◽

pp. 688-700 ◽

Author(s):

T.-H. Hubert Chan ◽

Bintao Sun

Keyword(s):

Approximation Algorithms ◽

Primal Dual ◽

Sparsest Cut ◽

Directed Hypergraph

Download Full-text

Erratum: Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_61 ◽

2014 ◽

pp. E2-E2

Author(s):

Dachuan Xu ◽

Fengmin Wang ◽

Donglei Du ◽

Chenchen Wu

Keyword(s):

Approximation Algorithms ◽

Vertex Cover ◽

Download Full-text

Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2016.03.004 ◽

2016 ◽

Vol 82 (6) ◽

pp. 1044-1063

Author(s):

Mohammad Khairul Hasan ◽

Kyung-Yong Chwa

Keyword(s):

Approximation Algorithms ◽

Graph Partitioning ◽

Partitioning Problems ◽

Download Full-text

From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems

Operations Research ◽

10.1287/opre.46.4.503 ◽

1998 ◽

Vol 46 (4) ◽

pp. 503-514 ◽

Author(s):

Dimitris Bertsimas ◽

Chung-Piaw Teo

Keyword(s):

Approximation Algorithms ◽

Valid Inequalities ◽

Covering Problems ◽

Primal Dual ◽

Download Full-text

Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

SIAM Journal on Computing ◽

10.1137/s0097539793260763 ◽

1998 ◽

Vol 28 (2) ◽

pp. 525-540 ◽

Author(s):

Sridhar Rajagopalan ◽

Vijay V. Vazirani

Keyword(s):

Approximation Algorithms ◽

Set Cover ◽

Integer Programs ◽

Download Full-text

Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties

Numerical Algebra Control & Optimization ◽

10.3934/naco.2015.5.91 ◽

2015 ◽

Vol 5 (2) ◽

pp. 91-100

Author(s):

Fengmin Wang ◽

◽

Dachuan Xu ◽

Donglei Du ◽

Chenchen Wu ◽

...

Keyword(s):

Approximation Algorithms ◽

Set Cover ◽

Download Full-text

Primal-dual approximation algorithms for feedback problems in planar graphs

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-61310-2_12 ◽

1996 ◽

pp. 147-161 ◽

Author(s):

Michel X. Goemans ◽

David P. Williamson

Keyword(s):

Approximation Algorithms ◽

Planar Graphs ◽

Download Full-text

Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM ◽

10.1145/375827.375845 ◽

2001 ◽

Vol 48 (2) ◽

pp. 274-296 ◽

Author(s):

Kamal Jain ◽

Vijay V. Vazirani

Keyword(s):

Approximation Algorithms ◽

Facility Location ◽

Lagrangian Relaxation ◽

Primal Dual ◽

Median Problems

Download Full-text

Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs

Information and Computation ◽

10.1016/j.ic.2012.10.017 ◽

2013 ◽

Vol 222 ◽

pp. 293-306 ◽

Author(s):

Carsten Moldenhauer

Keyword(s):

Approximation Algorithms ◽

Planar Graphs ◽

Steiner Forest ◽

Download Full-text

Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-56939-1_62 ◽

1993 ◽

pp. 64-75 ◽

Author(s):

Naveen Garg ◽

Vijay V. Vazirani ◽

Mihalis Yannakakis

Keyword(s):

Approximation Algorithms ◽

Set Cover ◽

Download Full-text

Primal-dual schema based approximation algorithms

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/bfb0030890 ◽

1995 ◽

pp. 650-652 ◽

Author(s):

Vijay V. Vazirani

Keyword(s):

Approximation Algorithms ◽

Download Full-text