Lower Bounds for One-To-One Packet Routing on Trees Using Hot-Potato Algorithms

Computer Journal - United Kingdom
doi 10.1093/comjnl/45.4.423
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Oxford University Press (OUP)

Related search

Lower Bounds for Eigenvalues of the One-Dimensionalp-Laplacian

Abstract and Applied Analysis
Applied MathematicsAnalysis
2004English

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1974English

Hot Stuff for One Year (HSOY)

Astronomy and Astrophysics
AstrophysicsAstronomyPlanetary ScienceSpace
2017English

Efficient Algorithms and Lower Bounds for Robust Linear Regression

2019English

Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

One Approach for Parallel Algorithms Representation

Balkan Journal of Electrical and Computer Engineering
2017English

Hexagonal Grid Drawings: Algorithms and Lower Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Barrier Functions and Interior-Point Algorithms for Linear Programming With Zero-, One-, or Two-Sided Bounds on the Variables

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
1995English

Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy