scientific article; zbMATH DE number 1261807
From MaRDI portal
Publication:4231910
zbMath0938.68752MaRDI QIDQ4231910
Publication date: 26 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Call control with \(k\) rejections ⋮ Call admission problems on grids with advice ⋮ A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem ⋮ The shortest multipaths problem in a capacitated dense channel ⋮ Online packet-routing in grids with bounded buffers ⋮ Solving the edge‐disjoint paths problem using a two‐stage method ⋮ The disjoint paths problem in quadratic time ⋮ Scheduling multicasts on unit-capacity trees and meshes. ⋮ Unnamed Item ⋮ A Preemptive Algorithm for Maximizing Disjoint Paths on Trees ⋮ On-line routing in all-optical networks ⋮ Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs ⋮ Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs ⋮ On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints ⋮ The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs ⋮ Disjoint paths in sparse graphs ⋮ A preemptive algorithm for maximizing disjoint paths on trees ⋮ Path problems in generalized stars, complete graphs, and brick wall graphs ⋮ Minimal multicut and maximal integer multiflow: a survey ⋮ Short length Menger's theorem and reliable optical routing ⋮ Conversion of coloring algorithms into maximum weight independent set algorithms ⋮ Inapproximability and approximability of maximal tree routing and coloring ⋮ New algorithms for maximum disjoint paths based on tree-likeness ⋮ Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems ⋮ New Hardness Results for Routing on Disjoint Paths ⋮ Approximations for the disjoint paths problem in high-diameter planar networks ⋮ Adaptive packet routing for bursty adversarial traffic ⋮ On-line routing in all-optical networks ⋮ Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs
This page was built for publication:
