Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

49

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540228561, 9783540277989

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Coloring Octrees

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_9 ◽

2004 ◽

pp. 62-71

Author(s):

Udo Adamy ◽

Michael Hoffmann ◽

József Solymosi ◽

Miloš Stojaković

Download Full-text

Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_48 ◽

2004 ◽

pp. 450-461 ◽

Author(s):

Tatsuie Tsukiji ◽

Zhi-Zhong Chen

Download Full-text

New Approximation Algorithms for Some Dynamic Storage Allocation Problems

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_37 ◽

2004 ◽

pp. 339-348 ◽

Author(s):

Shuai Cheng Li ◽

Hon Wai Leong ◽

Steven K. Quek

Keyword(s):

Approximation Algorithms ◽

Storage Allocation ◽

Dynamic Storage Allocation ◽

Allocation Problems ◽

Dynamic Storage

Download Full-text

Maximization of the Size and the Weight of Schedules of Degradable Intervals

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_25 ◽

2004 ◽

pp. 219-228 ◽

Author(s):

Fabien Baille ◽

Evripidis Bampis ◽

Christian Laforest

Download Full-text

Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_14 ◽

2004 ◽

pp. 112-121 ◽

Author(s):

Ying Du ◽

Danny Z. Chen ◽

Xiaodong Wu

Keyword(s):

Experimental Study ◽

Approximation Algorithms ◽

Multicommodity Flow ◽

Normalized Cut ◽

Download Full-text

A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_31 ◽

2004 ◽

pp. 278-289 ◽

Author(s):

Tadao Takaoka

Keyword(s):

Shortest Path ◽

Shortest Path Problem ◽

All Pairs Shortest Path

Download Full-text

The Worst-Case Time Complexity for Generating All Maximal Cliques

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_19 ◽

2004 ◽

pp. 161-170 ◽

Author(s):

Etsuji Tomita ◽

Akira Tanaka ◽

Haruhisa Takahashi

Keyword(s):

Time Complexity ◽

Download Full-text

One-to-Many Disjoint Path Covers in a Graph with Faulty Elements

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_42 ◽

2004 ◽

pp. 392-401 ◽

Author(s):

Jung-Heum Park

Keyword(s):

Download Full-text

k-Center Problems with Minimum Coverage

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_38 ◽

2004 ◽

pp. 349-359 ◽

Author(s):

Andrew Lim ◽

Brian Rodrigues ◽

Fan Wang ◽

Zhou Xu

Download Full-text

Towards Constructing Optimal Strip Move Sequences

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_6 ◽

2004 ◽

pp. 33-42 ◽

Author(s):

Meena Mahajan ◽

Raghavan Rama ◽

S. Vijayakumar

Download Full-text