Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

55

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642226847, 9783642226854

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-22685-4_5 ◽

2011 ◽

pp. 49-61 ◽

Author(s):

Daming Zhu ◽

Shaohan Ma ◽

Pingping Zhang

Keyword(s):

Local Search ◽

Maximum Satisfiability ◽

Satisfiability Problems

Download Full-text

Summing Symbols in Mutual Recurrences

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-22685-4_46 ◽

2011 ◽

pp. 531-542

Author(s):

Berkeley R. Churchill ◽

Edmund A. Lamagna

Download Full-text

ReachFewL = ReachUL

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-22685-4_23 ◽

2011 ◽

pp. 252-258 ◽

Author(s):

Brady Garvin ◽

Derrick Stolee ◽

Raghunath Tewari ◽

N. V. Vinodchandran

Download Full-text

Optimal Strategies for the One-Round Discrete Voronoi Game on a Line

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-22685-4_19 ◽

2011 ◽

pp. 213-224

Author(s):

Aritra Banik ◽

Bhaswar B. Bhattacharya ◽

Sandip Das

Keyword(s):

Optimal Strategies ◽

The One ◽

Download Full-text

Self-assembling Rulers for Approximating Generalized Sierpinski Carpets

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-22685-4_26 ◽

2011 ◽

pp. 284-296 ◽

Author(s):

Steven M. Kautz ◽

Brad Shutters

Keyword(s):

Self Assembling ◽

Sierpinski Carpets

Download Full-text

A New Conditionally Anonymous Ring Signature

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-22685-4_42 ◽

2011 ◽

pp. 479-491 ◽

Author(s):

Shengke Zeng ◽

Shaoquan Jiang ◽

Zhiguang Qin

Keyword(s):

Download Full-text

The Topology Aware File Distribution Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-22685-4_33 ◽

2011 ◽

pp. 366-378

Author(s):

Shawn T. O’Neil ◽

Amitabh Chaudhary ◽

Danny Z. Chen ◽

Haitao Wang

Keyword(s):

Distribution Problem ◽

File Distribution

Download Full-text

(1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-22685-4_24 ◽

2011 ◽

pp. 259-270

Author(s):

Yuichi Asahiro ◽

Kenta Kanmera ◽

Eiji Miyano

Keyword(s):

Resource Augmentation ◽

Code Assignment ◽

Competitive Algorithm

Download Full-text

Matching and P 2-Packing: Weighted Versions

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-22685-4_31 ◽

2011 ◽

pp. 343-353 ◽

Author(s):

Qilong Feng ◽

Jianxin Wang ◽

Jianer Chen

Download Full-text

Computing the Girth of a Planar Graph in Linear Time

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-22685-4_20 ◽

2011 ◽

pp. 225-236

Author(s):

Hsien-Chih Chang ◽

Hsueh-I Lu

Keyword(s):

Planar Graph ◽

Download Full-text