Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642143540, 9783642143557

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Online Splitting Interval Scheduling on m Identical Machines

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

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

2010 ◽

pp. 304-313

Author(s):

Feifeng Zheng ◽

Bo Liu ◽

Yinfeng Xu ◽

E. Zhang

Keyword(s):

Interval Scheduling ◽

Identical Machines

Download Full-text

A VaR Algorithm for Warrants Portfolio

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

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

2010 ◽

pp. 103-111

Author(s):

Jun Dai ◽

Liyun Ni ◽

Xiangrong Wang ◽

Weizhong Chen

Download Full-text

Comparison of Two Algorithms for Computing Page Importance

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14355-7_1 ◽

2010 ◽

pp. 1-11 ◽

Cited By ~ 2

Author(s):

Yuting Liu ◽

Zhi-Ming Ma

Download Full-text

Feasibility Testing for Dial-a-Ride Problems

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14355-7_18 ◽

2010 ◽

pp. 170-179 ◽

Cited By ~ 5

Author(s):

Dag Haugland ◽

Sin C. Ho

Keyword(s):

Feasibility Testing

Download Full-text

Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

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

2010 ◽

pp. 261-270 ◽

Cited By ~ 6

Author(s):

Yong Wu ◽

Qifan Yang

Keyword(s):

Service Provision ◽

Scheduling Algorithms ◽

Online Scheduling ◽

Grade Of Service ◽

Identical Machines ◽

Parallel Identical Machines

Download Full-text

Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14355-7_20 ◽

2010 ◽

pp. 191-198

Author(s):

Ming Liu ◽

Chengbin Chu ◽

Yinfeng Xu ◽

Lu Wang

Keyword(s):

Online Scheduling ◽

Availability Constraint ◽

Uniform Machines

Download Full-text

Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14355-7_13 ◽

2010 ◽

pp. 119-130 ◽

Cited By ~ 3

Author(s):

Christian Ernst ◽

Changxing Dong ◽

Gerold Jäger ◽

Dirk Richter ◽

Paul Molitor

Download Full-text

Online Uniformly Inserting Points on Grid

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

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

2010 ◽

pp. 281-292

Author(s):

Yong Zhang ◽

Zhuo Chang ◽

Francis Y. L. Chin ◽

Hing-Fung Ting ◽

Yung H. Tsin

Download Full-text

Approximating Maximum Edge 2-Coloring in Simple Graphs

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14355-7_9 ◽

2010 ◽

pp. 78-89 ◽

Cited By ~ 1

Author(s):

Zhi-Zhong Chen ◽

Sayuri Konno ◽

Yuki Matsushita

Keyword(s):

Simple Graphs

Download Full-text

Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14355-7_3 ◽

2010 ◽

pp. 13-24 ◽

Cited By ~ 1

Author(s):

E. Álvarez-Miranda ◽

A. Candia ◽

X. Chen ◽

X. Hu ◽

B. Li

Keyword(s):

Steiner Tree ◽

Interval Data ◽

Efficient Algorithms ◽

Steiner Tree Problems ◽

Prize Collecting

Download Full-text

Algorithmic Aspects in Information and Management - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Online Splitting Interval Scheduling on m Identical Machines

A VaR Algorithm for Warrants Portfolio

Comparison of Two Algorithms for Computing Page Importance

Feasibility Testing for Dial-a-Ride Problems

Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision

Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint

Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction

Online Uniformly Inserting Points on Grid

Approximating Maximum Edge 2-Coloring in Simple Graphs

Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science
Latest Publications