scientific article; zbMATH DE number 4051669

zbMATH Open0645.05047MaRDI QIDQ3788043FDOQ3788043

Authors: V. M. Bondarov, V. I. Rublinetskij, V. L. Sigalov 

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• On a bottleneck routing problem
• Routing through a generalized switchbox
• Routing in polygons without rectilinearly visible corners
• Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
• scientific article; zbMATH DE number 4039320

zbMATH Keywords

shortest pathrouting probleminitial obstacles

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cited In (13)

• Construction Line Algorithms for the Connection Location-Allocation Problem
• An algorithm for finding the number of shortest routes on square lattices
• Graph Drawing
• Title not available (Why is that?)
• A solvable routing problem
• Time complexity of a path formulated optimal routing algorithm (second printing)
• Graphical-structure-based models for routing problems
• Title not available (Why is that?)
• On constructing the shortest circuits on a set of line segments
• Routing with critical paths
• UNLEASHING THE VERMIN (VECTORED ROUTE-LENGTH MINIMIZATION)
• Title not available (Why is that?)
• Generating and counting valid patterns in routes between two points

This page was built for publication:

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