Frontiers in Algorithmics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

24

(FIVE YEARS 0)

H-INDEX

2

(FIVE YEARS 0)

Published By Springer International Publishing

9783319596044, 9783319596051

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Complete Submodularity Characterization in the Comparative Independent Cascade Model

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59605-1_6 ◽

2017 ◽

pp. 56-67

Author(s):

Wei Chen ◽

Hanrui Zhang

Keyword(s):

Cascade Model ◽

Independent Cascade Model ◽

Independent Cascade

Download Full-text

A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59605-1_15 ◽

2017 ◽

pp. 163-174 ◽

Author(s):

Weidong Li ◽

Xi Liu ◽

Xiaolu Zhang ◽

Xuejie Zhang

Download Full-text

The Broken-Triangle Property with Adjoint Values

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59605-1_9 ◽

2017 ◽

pp. 91-102

Author(s):

Jian Gao ◽

Rong Chen ◽

Minghao Yin ◽

Hui Li

Download Full-text

A Risk–Reward Model for On-line Financial Leasing Problem with an Interest Rate

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59605-1_7 ◽

2017 ◽

pp. 68-78 ◽

Author(s):

Xiaoli Chen ◽

Weijun Xu

Keyword(s):

Interest Rate ◽

Financial Leasing ◽

Download Full-text

Online Strategies for Evacuating from a Convex Region in the Plane

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59605-1_14 ◽

2017 ◽

pp. 151-162

Author(s):

Songhua Li ◽

Yinfeng Xu

Keyword(s):

Convex Region ◽

Online Strategies

Download Full-text

On Approximation Algorithms for Two-Stage Scheduling Problems

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59605-1_22 ◽

2017 ◽

pp. 241-253 ◽

Author(s):

Guangwei Wu ◽

Jianer Chen ◽

Jianxin Wang

Keyword(s):

Approximation Algorithms ◽

Scheduling Problems ◽

Download Full-text

Phase Transition for Maximum Not-All-Equal Satisfiability

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59605-1_24 ◽

2017 ◽

pp. 267-279

Author(s):

Junping Zhou ◽

Shuli Hu ◽

Tingting Zou ◽

Minghao Yin

Keyword(s):

Phase Transition

Download Full-text

On the Complexity of Minimizing the Total Calibration Cost

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59605-1_1 ◽

2017 ◽

pp. 1-12 ◽

Author(s):

Eric Angel ◽

Evripidis Bampis ◽

Vincent Chau ◽

Vassilis Zissimopoulos

Download Full-text

Designing and Implementing Algorithms for the Closest String Problem

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59605-1_8 ◽

2017 ◽

pp. 79-90

Author(s):

Shota Yuasa ◽

Zhi-Zhong Chen ◽

Bin Ma ◽

Lusheng Wang

Keyword(s):

Download Full-text

The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59605-1_3 ◽

2017 ◽

pp. 22-33

Author(s):

Arindam Biswas ◽

Varunkumar Jayapaul ◽

Venkatesh Raman ◽

Srinivasa Rao Satti

Keyword(s):

Download Full-text