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 International Publishing

9783319079554, 9783319079561

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An Auction-Bargaining Model for Initial Emission Permits

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

10.1007/978-3-319-07956-1_30 ◽

2014 ◽

pp. 331-340

Author(s):

Lili Ding ◽

Xiaoling Wang ◽

Wanglin Kang

Keyword(s):

Bargaining Model ◽

Emission Permits

Download Full-text

A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler

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

10.1007/978-3-319-07956-1_26 ◽

2014 ◽

pp. 288-298 ◽

Cited By ~ 2

Author(s):

Mingyu Xiao

Keyword(s):

Linear Kernel ◽

Feedback Vertex Set ◽

Vertex Set

Download Full-text

On the Exact Block Cover Problem

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

10.1007/978-3-319-07956-1_2 ◽

2014 ◽

pp. 13-22 ◽

Cited By ~ 2

Author(s):

Haitao Jiang ◽

Bing Su ◽

Mingyu Xiao ◽

Yinfeng Xu ◽

Farong Zhong ◽

...

Keyword(s):

Cover Problem

Download Full-text

Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes

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

10.1007/978-3-319-07956-1_10 ◽

2014 ◽

pp. 100-111

Author(s):

Daiki Hoshika ◽

Eiji Miyano

Keyword(s):

Approximation Algorithms ◽

Steiner Trees ◽

Packing Element

Download Full-text

An Optimal Context for Information Retrieval

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

10.1007/978-3-319-07956-1_29 ◽

2014 ◽

pp. 323-330

Author(s):

Rabeb Mbarek ◽

Mohamed Tmar ◽

Hawete Hattab

Keyword(s):

Information Retrieval

Download Full-text

The Garden Hose Complexity for the Equality Function

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

10.1007/978-3-319-07956-1_11 ◽

2014 ◽

pp. 112-123 ◽

Cited By ~ 2

Author(s):

Well Y. Chiu ◽

Mario Szegedy ◽

Chengu Wang ◽

Yixin Xu

Download Full-text

Minimax Regret k-sink Location Problem in Dynamic Path Networks

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

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

2014 ◽

pp. 23-31 ◽

Cited By ~ 4

Author(s):

Guanqun Ni ◽

Yinfeng Xu ◽

Yucheng Dong

Keyword(s):

Location Problem ◽

Minimax Regret ◽

Dynamic Path ◽

Sink Location

Download Full-text

Multiple Sink Location Problems in Dynamic Path Networks

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

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

2014 ◽

pp. 149-161 ◽

Cited By ~ 5

Author(s):

Yuya Higashikawa ◽

Mordecai J. Golin ◽

Naoki Katoh

Keyword(s):

Location Problems ◽

Multiple Sink ◽

Dynamic Path ◽

Sink Location

Download Full-text

Broadcast Networks with Near Optimal Cost

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

10.1007/978-3-319-07956-1_28 ◽

2014 ◽

pp. 312-322

Author(s):

Hovhannes A. Harutyunyan

Keyword(s):

Optimal Cost ◽

Broadcast Networks

Download Full-text

New Lower Bounds on Broadcast Function

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

10.1007/978-3-319-07956-1_16 ◽

2014 ◽

pp. 174-184 ◽

Cited By ~ 5

Author(s):

Hayk Grigoryan ◽

Hovhannes A. Harutyunyan

Keyword(s):

Lower Bounds

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

An Auction-Bargaining Model for Initial Emission Permits

A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler

On the Exact Block Cover Problem

Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes

An Optimal Context for Information Retrieval

The Garden Hose Complexity for the Equality Function

Minimax Regret k-sink Location Problem in Dynamic Path Networks

Multiple Sink Location Problems in Dynamic Path Networks

Broadcast Networks with Near Optimal Cost

New Lower Bounds on Broadcast Function

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