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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540735557, 9783540735564

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

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 ◽

Cited By ~ 3

Author(s):

Xujin Chen ◽

Jie Hu ◽

Xiaodong Hu

Keyword(s):

Spanning Tree ◽

Minimum Risk

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 ◽

Cited By ~ 1

Author(s):

Andreas W. M. Dress ◽

Katharina T. Huber ◽

Jacobus Koolen ◽

Vincent Moulton

Keyword(s):

Metric Spaces ◽

Cut Points ◽

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 ◽

Cited By ~ 9

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

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 ◽

Cited By ~ 2

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 ◽

Cited By ~ 3

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 ◽

Cited By ~ 6

Author(s):

Danyu Bai ◽

Lixin Tang

Keyword(s):

Lower Bound ◽

Completion Time ◽

Flow Shop ◽

Case Analysis ◽

Worst Case Analysis ◽

Worst Case ◽

Time Problem ◽

Weighted Completion Time

Download Full-text

Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

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

2007 ◽

pp. 200-207

Author(s):

Eric J. Friedman ◽

Adam Scott Landsberg

Keyword(s):

Combinatorial Games

Download Full-text

Combinatorics from Bacterial Genomes

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

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

2007 ◽

pp. 3-3

Author(s):

Bailin Hao

Keyword(s):

Bacterial Genomes

Download Full-text

Communication Leading to Nash Equilibrium Through Robust Messages – S5-Knowledge Model Case –

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

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

2007 ◽

pp. 136-145 ◽

Cited By ~ 2

Author(s):

Takashi Matsuhisa

Keyword(s):

Nash Equilibrium ◽

Knowledge Model ◽

Model Case

Download Full-text

Combinatorial Optimization and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The Minimum Risk Spanning Tree Problem

An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces

K-Connected Target Coverage Problem in Wireless Sensor Networks

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

A Lower Bound on Approximation Algorithms for the Closest Substring Problem

Infinite Families of Optimal Double-Loop Networks

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

Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp

Combinatorics from Bacterial Genomes

Communication Leading to Nash Equilibrium Through Robust Messages – S5-Knowledge Model Case –

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