Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319087825, 9783319087832

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Numerical Tic-Tac-Toe on the 4×4 Board

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_46 ◽

2014 ◽

pp. 537-546

Author(s):

Bryce Sandlund ◽

Kerrick Staley ◽

Michael Dixon ◽

Steve Butler

Download Full-text

Erratum: Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_61 ◽

2014 ◽

pp. E2-E2

Author(s):

Dachuan Xu ◽

Fengmin Wang ◽

Donglei Du ◽

Chenchen Wu

Keyword(s):

Approximation Algorithms ◽

Vertex Cover ◽

Primal Dual

Download Full-text

Mining the Key Structure of the Information Diffusion Network

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_58 ◽

2014 ◽

pp. 667-675

Author(s):

Jingzong Yang ◽

Li Wang ◽

Weili Wu

Keyword(s):

Information Diffusion

Download Full-text

Online Prediction Problems with Variation

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_5 ◽

2014 ◽

pp. 49-60 ◽

Cited By ~ 1

Author(s):

Chia-Jung Lee ◽

Shi-Chun Tsai ◽

Ming-Chuan Yang

Keyword(s):

Online Prediction ◽

Prediction Problems

Download Full-text

Improved Approximation for Time-Dependent Shortest Paths

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_39 ◽

2014 ◽

pp. 453-464

Author(s):

Masoud Omran ◽

Jörg-Rüdiger Sack

Keyword(s):

Shortest Paths ◽

Time Dependent

Download Full-text

Approximating High-Dimensional Range Queries with kNN Indexing Techniques

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_32 ◽

2014 ◽

pp. 369-380 ◽

Cited By ~ 2

Author(s):

Michael A. Schuh ◽

Tim Wylie ◽

Chang Liu ◽

Rafal A. Angryk

Keyword(s):

High Dimensional ◽

Range Queries ◽

Indexing Techniques ◽

Dimensional Range

Download Full-text

A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_28 ◽

2014 ◽

pp. 324-335 ◽

Cited By ~ 1

Author(s):

Chenchen Wu ◽

Dachuan Xu ◽

Donglei Du ◽

Wen-qing Xu

Keyword(s):

Approximation Algorithm ◽

Semidefinite Programming ◽

Complex Semidefinite Programming

Download Full-text

Improved Approximation Algorithms for a Bilevel Knapsack Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_27 ◽

2014 ◽

pp. 312-323

Author(s):

Xian Qiu ◽

Walter Kern

Keyword(s):

Approximation Algorithms ◽

Knapsack Problem

Download Full-text

Complexity of Dense Bicluster Editing Problems

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_14 ◽

2014 ◽

pp. 154-165 ◽

Cited By ~ 2

Author(s):

Peng Sun ◽

Jiong Guo ◽

Jan Baumbach

Download Full-text

Building above Read-once Polynomials: Identity Testing and Hardness of Representation

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_1 ◽

2014 ◽

pp. 1-12 ◽

Cited By ~ 1

Author(s):

Meena Mahajan ◽

B. V. Raghavendra Rao ◽

Karteek Sreenivasaiah

Keyword(s):

Identity Testing

Download Full-text

Lecture Notes in Computer Science - Computing and CombinatoricsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Numerical Tic-Tac-Toe on the 4×4 Board

Erratum: Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties

Mining the Key Structure of the Information Diffusion Network

Online Prediction Problems with Variation

Improved Approximation for Time-Dependent Shortest Paths

Approximating High-Dimensional Range Queries with kNN Indexing Techniques

A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem

Improved Approximation Algorithms for a Bilevel Knapsack Problem

Complexity of Dense Bicluster Editing Problems

Building above Read-once Polynomials: Identity Testing and Hardness of Representation

Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications