Combinatorial Optimization and Applications
Springer Berlin (Verlag)
978-3-642-17457-5 (ISBN)
Termination of Multipartite Graph Series Arising from Complex Network Modelling.- Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids.- Evacuation of Rectilinear Polygons.- A Fast Algorithm for Powerful Alliances in Trees.- NP-Completeness of Spreading Colored Points.- Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach.- Feasibility-Based Bounds Tightening via Fixed Points.- A Characterisation of Stable Sets in Games with Transitive Preference.- Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering.- An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations.- Bases of Primitive Nonpowerful Sign Patterns.- Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures.- Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets.- Finding Strong Bridges and Strong Articulation Points in Linear Time.- Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks.- An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs.- On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs.- Cyclic Vertex Connectivity of Star Graphs.- The Number of Shortest Paths in the (n, k)-Star Graphs.- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems.- PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks.- A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP.- Computing Toolpaths for 5-Axis NC Machines.- A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs.- A Randomized Algorithm for Weighted Approximation of Points by a Step Function.- Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials.- The Union of Colorful Simplices Spanned by a Colored Point Set.- Compact Visibility Representation of 4-Connected Plane Graphs.- Some Variations on Constrained Minimum Enclosing Circle Problem.- Searching for an Axis-Parallel Shoreline.- Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs.- Scheduling Packets with Values and Deadlines in Size-Bounded Buffers.- Transporting Jobs through a Processing Center with Two Parallel Machines.
| Erscheint lt. Verlag | 9.12.2010 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XV, 424 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 661 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • algorithms • approximation algorithms • Bioinformatics • Cloud Computing • combinatorial optimization • combinatorics • Complexity • Computational Algebra • Computational Biology • computational financing • Computational Game Theory • Computational Geometry • Computational Learning Theory • Computational Number Theory • data structures • Distributed Computing • Extremal graph theory • Graph Algorithms • graph searching • network design • Network Flow • Network Models • network optimization problems • Operation Research • Optical networks • Parallel Computing • Processing • Routing • Scheduling • wireless networks |
| ISBN-10 | 3-642-17457-4 / 3642174574 |
| ISBN-13 | 978-3-642-17457-5 / 9783642174575 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
