Graphs and Algorithms in Communication Networks on Seven League Boots

DOI10.1007/978-3-642-02250-0_1zbMath1187.68551OpenAlexW36196560MaRDI QIDQ3404458

Arie M. C. A. Koster, Xavier Muñoz

Publication date: 9 February 2010

Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02250-0_1

zbMATH Keywords

combinatorial optimizationnetworksgraph theorytopology designroutingnetwork planningfrequency assignmentnetwork coverage

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• SCIP
• SteinLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• SCIP: solving constraint integer programs
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• A new polynomial-time algorithm for linear programming
• A new look at fault-tolerant network routing
• Large fault-tolerant interconnection networks
• An exact algorithm for the capacitated facility location problems with single sourcing
• Source sink flows with capacity installation in batches
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• Minimum cost capacity installation for multicommodity network flows
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• Frequency assignment in cellular phone networks
• On forwarding indices of networks
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Linear programming. Foundations and extensions.
• The forwarding index of communication networks
• Fifty-Plus Years of Combinatorial Integer Programming
• Solving Real-World Linear Programs: A Decade and More of Progress
• Competitive paging algorithms
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• Disjoint paths in a network
• New methods to color the vertices of a graph
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Maximally connected digraphs
• Polyhedral techniques in combinatorial optimization II: applications and computations
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• Distributed Computing: A Locality-Sensitive Approach
• Polyhedral techniques in combinatorial optimization I: Theory
• Frequency planning and ramifications of coloring
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
• Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
• Reducibility among Combinatorial Problems
• Models and solution techniques for frequency assignment problems