Efficient delay routing
type: Item
instance of: scholarly article
title: Efficient delay routing
zbMATH Open document ID: 0902.68086
DOI: 10.1016/S0304-3975(97)00198-9
author: Miriam Di Ianni
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1189968
zbMATH Keywords: packet routing schemes
MaRDI profile type: Publication
cites work: Q3128902
cites work: Q4886092
cites work: Q3128890
cites work: Fast deflection routing for packets and worms
cites work: An algorithmic approach to the Lovász local lemma. I
cites work: Greedy Packet Scheduling
cites work: Q4228489
cites work: Q4228430
cites work: Q4198056
cites work: Approximation algorithms for combinatorial problems
cites work: Q4142699
cites work: Q4002466
cites work: Randomized Routing and Sorting on Fixed-Connection Networks
cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
cites work: Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
cites work: A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
cites work: Communication-efficient parallel algorithms for distributed random-access machines
cites work: Greedy packet scheduling on shortest paths (preliminary version)
cites work: A packet routing protocol for arbitrary networks
cites work: Q4527032
cites work: Optimization, approximation, and complexity classes
cites work: Efficient routing in all-optical networks
cites work: How to emulate shared memory
cites work: Q4527031
cites work: A Scheme for Fast Parallel Communication
description: scientific article; zbMATH DE number 1189968