| he LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community,with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available. The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes -proceedings (published in time for the respective conference) -post-proceedings (consisting of thoroughly revised final full papers) -research monographs (which may be based on outstanding PhD work,research projects, technical reports, etc.) |
| Mixed-Integer Cuts from Cyclic Groups Optimizing over the First Chvktal Closure Sequential Pairing of Mixed Integer Inequalities Approximate Min-max Relations for Odd Cycles in Planar Graphs Disjoint Cycles: Integrality Gap, Hardness, and Approximation A Combinatorial Algorithm to Find a Maximum Even Factor Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem Inventory and Facility Location Models with Market Selection On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials Approximation Algorithms for Semidefinite Packing Problems with Applications to MAXCUT and Graph Coloring On the Inefficiency of Equilibria in Congestion Games Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times LP-Based Online Scheduling: From Single to Parallel Machines Unique Sink Orientations of Grids Jumping Doesn't Help in Abstract Cubes Computing the Inertia from Sign Patterns Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem Smoothed Analysis of Integer Programming Circular Ones Matrices and the Stable Set Polytope of Quasi-line Graphs Approximation Algorithms for Stochastic Inventory Control Models On Two-Stage Stochastic Minimum Spanning Trees Combinatorial Analysis of Generic Matrix Pencils …… Author Index |
内容加载中，请稍后...
商品评论（0条）