close
1.

電子ブック

EB
edited by Laura Sanita, Martin Skutella
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9499
オンライン: http://dx.doi.org/10.1007/978-3-319-28684-6
目次情報: 続きを見る
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
Competitive analysis
Computational advertising
Computational finance
Cuts and connectivity
Geometric problems
Graph algorithms
Inapproximability
Mechanism design
Natural algorithms
Network design
Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
2.

電子ブック

EB
by Marek Cygan, Fedor V. Fomin, ?ukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Micha? Pilipczuk, Saket Saurabh
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
オンライン: http://dx.doi.org/10.1007/978-3-319-21275-3
目次情報: 続きを見る
Introduction
Kernelization
Bounded Search Trees
Iterative Compression
Randomized Methods in Parameterized Algorithms
Miscellaneous
Treewidth
Finding Cuts and Separators
Advanced Kernelization Algorithms
Algebraic Techniques: Sieves, Convolutions, and Polynomials
Improving Dynamic Programming on Tree Decompositions
Matroids
Fixed-Parameter Intractability
Lower Bounds Based on the Exponential-Time Hypothesis
Lower Bounds for Kernelization
Introduction
Kernelization
Bounded Search Trees
3.

電子ブック

EB
edited by Zaixin Lu, Donghyun Kim, Weili Wu, Wei Li, Ding-Zhu Du
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9486
オンライン: http://dx.doi.org/10.1007/978-3-319-26626-8
4.

電子ブック

EB
edited by M. Sohel Rahman, Etsuji Tomita
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8973
オンライン: http://dx.doi.org/10.1007/978-3-319-15612-5
目次情報: 続きを見る
Encoding Data Structures
Fast Algorithms for Constrained Graph Density Problems
The Directed Ring Loading with Penalty Cost
Edge-Colorings of Weighted Graphs (Extended Abstract)
Unit Covering in Color-Spanning Set Model
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem
A Practical Succinct Data Structure for Tree-Like Graphs
Forming Plurality at Minimum Cost
Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs
Straight-Path Queries in Trajectory Data
Folding a Paper Strip to Minimize Thickness
An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract)
PTAS’s for Some Metric p-source Communication Spanning Tree Problems
Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement
Enumerating Eulerian Trails via Hamiltonian Path Enumeration
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees
An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks
Dynamic Online Multiselection in Internal and External Memory
Competitive Analysis for Multi-objective Online Algorithms
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
An Improved Algorithm for Parameterized Edge Dominating Set Problem
On Bar (1, j)-Visibility Graphs (Extended Abstract)
Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs
Non-repetitive Strings over Alphabet Lists
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
Threshold Circuits for Global Patterns in 2-Dimensional Maps
Superset Generation on Decision Diagrams
On Triangle Cover Contact Graphs
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs
Encoding Data Structures
Fast Algorithms for Constrained Graph Density Problems
The Directed Ring Loading with Penalty Cost
5.

電子ブック

EB
edited by Christian Scheideler
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9439
オンライン: http://dx.doi.org/10.1007/978-3-319-25258-2
目次情報: 続きを見る
Communication Patterns and Input Patterns in Distributed Computing
Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach
Node Labels in Local Decision
Exact bounds for distributed graph colouring
Essential Traffic Parameters for Shared Memory Switch Performance. -Scheduling Multipacket Frames With Frame Deadlines
A Randomized Algorithm for Online Scheduling
Online Admission Control and Embedding of Service Chains
Optimizing Spread of Inuence in Social Networks via Partial Incentives
Approximation Algorithms For Multi-Budgeted Network Design Problems
Simple Distributed + 1 Coloring in the SINR Model
Nearly Optimal Local Broadcasting in the SINR Model with Feedback
Byzantine Gathering in Networks
Signature-free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation
Path-Fault-Tolerant Approximate Shortest-Path Trees
A faster computation of all the best swap edges of a tree spanner
Randomized OBDD-Based Graph Algorithms
On Fast and Robust Information Spreading in the Vertex-Congest Model
Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority
The Computability of Relaxed Data Structures: Queues and Stacks as Examples
Comparison-based Interactive Collaborative Filtering
Coalescing walks on rotor-router systems
Communication Patterns and Input Patterns in Distributed Computing
Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach
Node Labels in Local Decision
6.

電子ブック

EB
edited by Sumit Ganguly, Ramesh Krishnamurti
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8959
オンライン: http://dx.doi.org/10.1007/978-3-319-14974-5
目次情報: 続きを見る
Obstruction Characterizations in Graphs and Digraphs
Approximation Algorithms
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
Constant Approximation for Broadcasting in k-cycle Graph
Computational Geometry
Three paths to point placement
Vertex Guarding in Weak Visibility Polygons
On Collections of Polygons Cuttable with a Segment Saw
Rectilinear path problems in the presences of rectangular obstacles
Computational Complexity
Parameterized Analogues of Probabilistic Computation
Algebraic Expressions of Rhomboidal Graphs
Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter
Graph Theory. New Polynomial Case for Efficient Domination in P 6-free Graphs
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
Separator Theorems for Interval Graphs and Proper Interval Graphs
Bounds for the b-Chromatic Number of Induced Subgraphs and G e
New Characterizations Of Proper Interval Bigraphs and Proper Circular Arc Bigraphs
On Spectra of Corona Graphs
Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs
Tree Path Labeling of Hypergraphs A Generalization of the Consecutive Ones Property
On a special class of boxicity 2 graph
Algorithms
Associativity for Binary Parallel Processes: a Quantitative Study
A Tight Bound for Congestion of an Embedding.-Auction/Belief propagation algorithms for constrained assignment problem
Domination in some subclasses of bipartite graphs
Bi-directional Search for Skyline Probability
Cumulative vehicle routing problem: a column generation approach
Energy Efficient Sweep Coverage with Mobile and Static Sensors
Generation of Random Digital Curves using Combinatorial Techniques
Obstruction Characterizations in Graphs and Digraphs
Approximation Algorithms
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
7.

電子ブック

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
8.

電子ブック

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