Frontiers in Algorithmics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

31

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642145520, 9783642145537

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

New Algorithms for Barrier Coverage with Mobile Sensors

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14553-7_31 ◽

2010 ◽

pp. 327-338 ◽

Author(s):

Xuehou Tan ◽

Gangshan Wu

Keyword(s):

Mobile Sensors ◽

Barrier Coverage ◽

Download Full-text

Optimum Sweeps of Simple Polygons with Two Guards

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14553-7_29 ◽

2010 ◽

pp. 304-315 ◽

Author(s):

Xuehou Tan ◽

Bo Jiang

Keyword(s):

Simple Polygons

Download Full-text

Computational Geometry for Uncertain Data

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14553-7_2 ◽

2010 ◽

pp. 6-6

Author(s):

Mikhail J. Atallah

Keyword(s):

Computational Geometry ◽

Download Full-text

Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14553-7_22 ◽

2010 ◽

pp. 222-233

Author(s):

Joseph Wun-Tat Chan ◽

Francis Y. L. Chin ◽

Xin Han ◽

Ka-Cheong Lam ◽

Hing-Fung Ting ◽

...

Keyword(s):

Cellular Networks ◽

Download Full-text

Solving General Lattice Puzzles

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14553-7_14 ◽

2010 ◽

pp. 124-135

Author(s):

Gill Barequet ◽

Shahar Tal

Keyword(s):

General Lattice

Download Full-text

Computing Minimum Diameter Color-Spanning Sets

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14553-7_27 ◽

2010 ◽

pp. 285-292 ◽

Author(s):

Rudolf Fleischer ◽

Xiaoming Xu

Keyword(s):

Minimum Diameter

Download Full-text

O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14553-7_24 ◽

2010 ◽

pp. 250-261

Author(s):

Liang Ding ◽

Bin Fu ◽

Yunhui Fu ◽

Zaixin Lu ◽

Zhiyu Zhao

Keyword(s):

Bin Packing ◽

Approximation Schemes ◽

Subset Sum Problems

Download Full-text

An $\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})$ Space Lower Bound for Finding ε-Approximate Quantiles in a Data Stream

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14553-7_11 ◽

2010 ◽

pp. 89-100 ◽

Author(s):

Regant Y. S. Hung ◽

Hingfung F. Ting

Keyword(s):

Lower Bound ◽

Download Full-text

Minimum Common String Partition Revisited

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14553-7_7 ◽

2010 ◽

pp. 45-52 ◽

Author(s):

Haitao Jiang ◽

Binhai Zhu ◽

Daming Zhu ◽

Hong Zhu

Keyword(s):

Minimum Common String Partition

Download Full-text

Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14553-7_4 ◽

2010 ◽

pp. 11-22 ◽

Author(s):

Xiaotie Deng ◽

Yang Sun ◽

Ming Yin ◽

Yunhong Zhou

Keyword(s):

Mechanism Design ◽

Sponsored Search

Download Full-text