Combinatorial Optimization and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

39

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540735557, 9783540735564

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73556-4_36 ◽

2007 ◽

pp. 343-353 ◽

Author(s):

Jianxin Wang ◽

Xiaoshuang Xu ◽

Yunlong Liu

Keyword(s):

Exact Algorithm

Download Full-text

A Lower Bound on Approximation Algorithms for the Closest Substring Problem

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73556-4_31 ◽

2007 ◽

pp. 291-300 ◽

Author(s):

Jianxin Wang ◽

Min Huang ◽

Jianer Chen

Keyword(s):

Lower Bound ◽

Approximation Algorithms

Download Full-text

Infinite Families of Optimal Double-Loop Networks

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73556-4_25 ◽

2007 ◽

pp. 220-229

Author(s):

Xiaoping Dai ◽

Jianqin Zhou ◽

Xiaolin Wang

Keyword(s):

Double Loop ◽

Double Loop Networks

Download Full-text

Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73556-4_22 ◽

2007 ◽

pp. 191-199 ◽

Author(s):

Danyu Bai ◽

Lixin Tang

Keyword(s):

Lower Bound ◽

Completion Time ◽

Flow Shop ◽

Case Analysis ◽

Worst Case Analysis ◽

Time Problem ◽

Weighted Completion Time

Download Full-text

The Minimum Risk Spanning Tree Problem

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73556-4_11 ◽

2007 ◽

pp. 81-90 ◽

Author(s):

Xujin Chen ◽

Jie Hu ◽

Xiaodong Hu

Keyword(s):

Spanning Tree ◽

Download Full-text

An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73556-4_3 ◽

2007 ◽

pp. 4-10 ◽

Author(s):

Andreas W. M. Dress ◽

Katharina T. Huber ◽

Jacobus Koolen ◽

Vincent Moulton

Keyword(s):

Metric Spaces ◽

Finite Metric Spaces

Download Full-text

K-Connected Target Coverage Problem in Wireless Sensor Networks

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73556-4_5 ◽

2007 ◽

pp. 20-31 ◽

Author(s):

Deying Li ◽

Jiannong Cao ◽

Ming Liu ◽

Yuan Zheng

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Wireless Sensor ◽

Target Coverage ◽

Coverage Problem ◽

Target Coverage Problem

Download Full-text

A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73556-4_29 ◽

2007 ◽

pp. 267-278 ◽

Author(s):

Ernst Althaus ◽

Stefan Canzar

Keyword(s):

Lagrangian Relaxation ◽

Sequence Alignment ◽

Multiple Sequence Alignment ◽

Multiple Sequence ◽

Alignment Problem

Download Full-text

Algorithms for Minimum m-Connected k-Dominating Set Problem

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73556-4_21 ◽

2007 ◽

pp. 182-190 ◽

Author(s):

Weiping Shang ◽

Frances Yao ◽

Pengjun Wan ◽

Xiaodong Hu

Keyword(s):

Dominating Set ◽

Dominating Set Problem

Download Full-text

On the Complexity of Some Colorful Problems Parameterized by Treewidth

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73556-4_38 ◽

2007 ◽

pp. 366-377 ◽

Author(s):

Michael Fellows ◽

Fedor V. Fomin ◽

Daniel Lokshtanov ◽

Frances Rosamond ◽

Saket Saurabh ◽

...

Download Full-text