Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319947754, 9783319947761

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximation Algorithms on Multiple Two-Stage Flowshops

Lecture Notes in Computer Science - Computing and Combinatorics ◽

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

2018 ◽

pp. 713-725 ◽

Cited By ~ 1

Author(s):

Guangwei Wu ◽

Jianer Chen

Keyword(s):

Approximation Algorithms ◽

Two Stage

Download Full-text

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 ◽

Cited By ~ 1

Author(s):

T.-H. Hubert Chan ◽

Bintao Sun

Keyword(s):

Approximation Algorithms ◽

Primal Dual ◽

Sparsest Cut ◽

Directed Hypergraph

Download Full-text

An Approximation Framework for Bounded Facility Location Problems

Lecture Notes in Computer Science - Computing and Combinatorics ◽

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

2018 ◽

pp. 353-364

Author(s):

Wenchang Luo ◽

Bing Su ◽

Yao Xu ◽

Guohui Lin

Keyword(s):

Facility Location ◽

Location Problems ◽

Facility Location Problems

Download Full-text

Minimum Membership Hitting Sets of Axis Parallel Segments

Lecture Notes in Computer Science - Computing and Combinatorics ◽

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

2018 ◽

pp. 638-649 ◽

Cited By ~ 1

Author(s):

N. S. Narayanaswamy ◽

S. M. Dhannya ◽

C. Ramya

Keyword(s):

Hitting Sets ◽

Axis Parallel

Download Full-text

Manipulation Strategies for the Rank-Maximal Matching Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

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

2018 ◽

pp. 316-327 ◽

Cited By ~ 1

Author(s):

Pratik Ghosal ◽

Katarzyna Paluch

Keyword(s):

Matching Problem ◽

Maximal Matching

Download Full-text

Computing Coverage Kernels Under Restricted Settings

Lecture Notes in Computer Science - Computing and Combinatorics ◽

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

2018 ◽

pp. 180-191 ◽

Cited By ~ 1

Author(s):

Jérémy Barbay ◽

Pablo Pérez-Lantero ◽

Javiel Rojas-Ledesma

Download Full-text

Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

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

2018 ◽

pp. 726-737

Author(s):

Mugang Lin ◽

Bin Fu ◽

Qilong Feng

Keyword(s):

Approximation Algorithm ◽

Constant Factor

Download Full-text

Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality

Lecture Notes in Computer Science - Computing and Combinatorics ◽

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

2018 ◽

pp. 293-304

Author(s):

Nanao Kita

Download Full-text

Improved Learning of k-Parities

Lecture Notes in Computer Science - Computing and Combinatorics ◽

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

2018 ◽

pp. 542-553

Author(s):

Arnab Bhattacharyya ◽

Ameet Gadekar ◽

Ninad Rajgopal

Keyword(s):

Improved Learning

Download Full-text

Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds

Lecture Notes in Computer Science - Computing and Combinatorics ◽

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

2018 ◽

pp. 416-427

Author(s):

Yingying Wang ◽

Kun Cheng ◽

Zimao Li

Keyword(s):

Minimum Cost ◽

Multiple Clouds ◽

Improved Algorithm

Download Full-text

Lecture Notes in Computer Science - Computing and CombinatoricsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Approximation Algorithms on Multiple Two-Stage Flowshops

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

An Approximation Framework for Bounded Facility Location Problems

Minimum Membership Hitting Sets of Axis Parallel Segments

Manipulation Strategies for the Rank-Maximal Matching Problem

Computing Coverage Kernels Under Restricted Settings

Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem

Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality

Improved Learning of k-Parities

Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds

Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications