Results 141 to 150 of about 218,121 (185)

All pairs almost shortest paths

Proceedings of 37th Conference on Foundations of Computer Science, 2000
Summary: Let \(G=(V,E)\) be an unweighted undirected graph on \(n\) vertices. A simple argument shows that computing all distances in \(G\) with an additive one-sided error of at most 1 is as hard as Boolean matrix multiplication. Building on recent work of \textit{D. Aingworth, C. Chekuri, P. Indyk} and \textit{R. Motwani} [SIAM J. Comput. 28, No.
Dor, Dorit, Halperin, Shay, Zwick, Uri
openaire   +2 more sources

Shortest Path Geometric Rounding

Algorithmica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Shortest Paths

2008
Shashi Shekhar, Hui Xiong
  +4 more sources

Shortest Paths

2021
openaire   +2 more sources

Antibiotic resistance in the patient with cancer: Escalating challenges and paths forward

Ca-A Cancer Journal for Clinicians, 2021
Amila K Nanayakkara, Vance G Fowler, Kevin Outterson   +2 more
exaly  

Shortest Paths

2011
Sanders, P., Singler, J.
openaire   +2 more sources

Differential pre-malignant programs and microenvironment chart distinct paths to malignancy in human colorectal polyps

Cell, 2021
Bob Chen, Eliot T Mckinley, Alan J Simmons   +2 more
exaly  

Lineage tracing reveals the phylodynamics, plasticity, and paths of tumor evolution

Cell, 2022
Dian Yang, Matthew G Jones, Kyung Hoi Min   +2 more
exaly  

Shortest Path Tree Algorithms

The shortest path tree problem is a classical and widely studied combinatorial problem. The scope of this article is to provide an extensive treatment of the major classical approaches. It then proceeds focusing on the auction algorithm and some of its recently developed variants.
openaire   +2 more sources

Adoption paths of digital transformation in manufacturing SME

International Journal of Production Economics, 2023
Elisa Battistoni, Simone Gitto, Gianluca Murgia   +2 more
exaly