Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540735441, 9783540735458

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximation Algorithms for the Black and White Traveling Salesman Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-73545-8_54 ◽

2007 ◽

pp. 559-567

Author(s):

Binay Bhattacharya ◽

Yuzhuang Hu ◽

Alexander Kononov

Keyword(s):

Approximation Algorithms ◽

Traveling Salesman Problem ◽

Traveling Salesman ◽

Black And White

Download Full-text

A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-73545-8_51 ◽

2007 ◽

pp. 526-536 ◽

Cited By ~ 7

Author(s):

Francis Y. L. Chin ◽

Yong Zhang ◽

Hong Zhu

Keyword(s):

Competitive Algorithm

Download Full-text

Priority Algorithms for the Subset-Sum Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-73545-8_49 ◽

2007 ◽

pp. 504-514

Author(s):

Yuli Ye ◽

Allan Borodin

Keyword(s):

Subset Sum Problem ◽

Priority Algorithms ◽

Subset Sum

Download Full-text

Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-73545-8_44 ◽

2007 ◽

pp. 448-458 ◽

Cited By ~ 3

Author(s):

Kristoffer Arnsfelt Hansen

Keyword(s):

Boolean Functions ◽

Symmetric Boolean Functions

Download Full-text

A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-73545-8_35 ◽

2007 ◽

pp. 349-359 ◽

Cited By ~ 1

Author(s):

Yunlong Liu ◽

Jianer Chen ◽

Jianxin Wang

Keyword(s):

Approximation Algorithm ◽

Counting Problem

Download Full-text

Finding Many Optimal Paths Without Growing Any Optimal Path Trees

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-73545-8_24 ◽

2007 ◽

pp. 232-242

Author(s):

Danny Z. Chen ◽

Ewa Misiołek

Keyword(s):

Optimal Path ◽

Optimal Paths

Download Full-text

The Combinatorics of Sequencing the Corn Genome

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-73545-8_1 ◽

2007 ◽

pp. 1-1

Author(s):

Srinivas Aluru

Download Full-text

An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-73545-8_47 ◽

2007 ◽

pp. 482-492 ◽

Cited By ~ 1

Author(s):

Shihyen Chen ◽

Kaizhong Zhang

Keyword(s):

Edit Distance ◽

Tree Edit Distance ◽

Improved Algorithm

Download Full-text

Dimension, Halfspaces, and the Density of Hard Sets

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-73545-8_15 ◽

2007 ◽

pp. 129-139 ◽

Cited By ~ 3

Author(s):

Ryan C. Harkins ◽

John M. Hitchcock

Download Full-text

An $\frac{8}{5}$ -Approximation Algorithm for a Hard Variant of Stable Marriage

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-73545-8_53 ◽

2007 ◽

pp. 548-558 ◽

Cited By ~ 2

Author(s):

Robert W. Irving ◽

David F. Manlove

Keyword(s):

Approximation Algorithm ◽

Stable Marriage

Download Full-text

Lecture Notes in Computer Science - Computing and CombinatoricsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Approximation Algorithms for the Black and White Traveling Salesman Problem

A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs

Priority Algorithms for the Subset-Sum Problem

Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates

A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem

Finding Many Optimal Paths Without Growing Any Optimal Path Trees

The Combinatorics of Sequencing the Corn Genome

An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity

Dimension, Halfspaces, and the Density of Hard Sets

An $\frac{8}{5}$ -Approximation Algorithm for a Hard Variant of Stable Marriage

Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications