close
1.

電子ブック

EB
edited by Evripidis Bampis, Ola Svensson
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8952
オンライン: http://dx.doi.org/10.1007/978-3-319-18263-6
目次情報: 続きを見る
Improved Approximations for the Max k-Colored Clustering Problem
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line
Better Algorithms for Online Bin Stretching
Online Colored Bin Packing
Improved Bound for Online Square-into-Square Packing
Improved Approximation Algorithm for Fault-Tolerant Facility Placement
The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
Online Multi-Coloring with Advice
Approximating Steiner Trees and Forests with Minimum Number of Steiner Points
Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling
Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage
Linear-Time Approximation Algorithms for Unit Disk Graphs
The Minimum Feasible Tileset Problem
Online Ad Assignment with an Ad Exchange
Minimum Linear Arrangement of Series-Parallel Graphs
Online Dual Edge Coloring of Paths and Trees
Online Packet Scheduling Under Adversarial Jamming
Generalized Hypergraph Matching via Iterated Packing and Local Ratio
Steiner Trees with Bounded RC-Delay
Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms
Routing Under Uncertainty: The a priori Traveling Repairman Problem
Primal-Dual Algorithms for Precedence Constrained Covering Problems
Improved Approximations for the Max k-Colored Clustering Problem
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line
Better Algorithms for Online Bin Stretching
2.

電子ブック

EB
edited by Evripidis Bampis
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9125
オンライン: http://dx.doi.org/10.1007/978-3-319-20086-6
目次情報: 続きを見る
Data Structures
Parallel Construction of Succinct Trees
Tree Compression with Top Trees Revisited
A Bulk-Parallel Priority Queue in External Memory with STXXL
Graph Problems I
Greedily Improving Our Own Centrality in a Network
An Exact Algorithm for Diameters of Large Real Directed Graphs
Graph Partitioning for Independent Sets
Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments
Combinatorial Optimization I
On the Generation of Cutting Planes which Maximize the Bound Improvement
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space
Scheduling and Allocation
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors
Station Assignment with Reallocation
Online Knapsack of Unknown Capacity: Energy Optimization for Smartphone Communications
Combinatorial Optimization II
Reoptimization Techniques for MIP Solvers
Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers
Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver
Efficient and Practical Tree Preconditioning for Solving Laplacian Systems
Other Applications I
Efficient Generation of Stable Planar Cages for Chemistry
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment
Solving k-means on High-Dimensional Big Data
X Contents
Transportation Networks
Public Transit Labeling
On Balanced Separators in Road Networks
SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks
Other Applications II
Huffman Codes versus Augmented Non-Prefix-Free Codes
Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps
in Bimatrix Games
The Effect of Almost-Empty Faces on Planar Kandinsky Drawings
Graph Problems II
An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem
On the Quadratic Shortest Path Problem
A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
Data Structures
Parallel Construction of Succinct Trees
Tree Compression with Top Trees Revisited