Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem

Saved in:
Bibliographic Details
Published in:ArXiv cs.CC Recent Papers
Format: Online Article RSS Article
Published: 2026
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1865217956986748928
collection WordPress RSS
FRELIP Feed Integration
container_title ArXiv cs.CC Recent Papers
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:51828
institution FRELIP
journal_source_facet ArXiv cs.CC Recent Papers
publishDate 2026
publishDateSort 2026
record_format rss_article
spellingShingle On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
ArXiv cs.CC Recent Papers
Chemical Engineering
Engineering & Technology
sub_discipline_display Chemical Engineering
sub_discipline_facet Chemical Engineering
subject_display ArXiv cs.CC Recent Papers
Chemical Engineering
Engineering & Technology
ArXiv cs.CC Recent Papers
Chemical Engineering
Engineering & Technology
subject_facet ArXiv cs.CC Recent Papers
Chemical Engineering
Engineering & Technology
title On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
title_auth On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
title_full On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
title_fullStr On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
title_full_unstemmed On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
title_short On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
title_sort on the complexity of the minimum-($k,ρ$)-shortcut problem
topic ArXiv cs.CC Recent Papers
Chemical Engineering
Engineering & Technology
url https://arxiv.org/abs/2605.13474v1