Graphs and algorithms in communication networks on seven league boots

DOI10.1007/978-3-642-02250-0_1zbMATH Open1187.68551OpenAlexW36196560MaRDI QIDQ3404458FDOQ3404458

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

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

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)

Cites Work

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

Cited In (1)

• Graph Theory and Mobile Communications

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)