Graphs and algorithms in communication networks on seven league boots

DOI10.1007/978-3-642-02250-0_1MaRDI QIDQ3404458zbMATH OpenOpenAlexFDO

Authors 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 optimizationgraph theorynetworksroutingfrequency assignmentnetwork planningtopology designnetwork coverage

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5173825
• scientific article; zbMATH DE number 858902
• Graph theory
• Optimization in telecommunication networks
• Communication networks. An optimization, control and stochastic networks perspective

Cites work

• scientific article; zbMATH DE number 1656903 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3121292 (Why is no real title available?)
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 3748742 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1240224 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 732976 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• scientific article; zbMATH DE number 2150800 (Why is no real title available?)
• scientific article; zbMATH DE number 2086928 (Why is no real title available?)
• scientific article; zbMATH DE number 795223 (Why is no real title available?)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• scientific article; zbMATH DE number 5485591 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 5070513 (Why is no real title available?)
• scientific article; zbMATH DE number 2196290 (Why is no real title available?)
• A new look at fault-tolerant network routing
• A new polynomial-time algorithm for linear programming
• A note on two problems in connexion with graphs
• An exact algorithm for the capacitated facility location problems with single sourcing
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Competitive paging algorithms
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• Disjoint paths in a network
• Distributed Computing: A Locality-Sensitive Approach
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• Fifty-plus years of combinatorial integer programming
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• Frequency assignment in cellular phone networks
• Frequency planning and ramifications of coloring
• Geometric algorithms and combinatorial optimization
• Graph theory with applications
• Large fault-tolerant interconnection networks
• Linear programming. Foundations and extensions.
• Maximally connected digraphs
• Minimum cost capacity installation for multicommodity network flows
• Models and solution techniques for frequency assignment problems
• Network flows. Theory, algorithms, and applications.
• New methods to color the vertices of a graph
• On forwarding indices of networks
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
• Polyhedral approaches to the design of survivable networks
• Polyhedral techniques in combinatorial optimization I: Theory
• Polyhedral techniques in combinatorial optimization II: applications and computations
• Reducibility among combinatorial problems
• SCIP: solving constraint integer programs
• Solving Real-World Linear Programs: A Decade and More of Progress
• Source sink flows with capacity installation in batches
• Steiner tree problems in telecommunications
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• The ellipsoid method and its consequences in combinatorial optimization
• The forwarding index of communication networks
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

Cited in

(1)

• Graph Theory and Mobile Communications

Describes a project that uses

Uses Software

• SCIP
• SteinLib

This page was built for publication: Graphs and algorithms in communication networks on seven league boots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404458)