Finding a Shortest $M$-link Path in a Monge Directed Acyclic Graph

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Wan, Joy Z.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On Incremental Approximate Shortest Paths in Directed Graphs
di: Górkiewicz, Adam, et al.
Pubblicazione: (2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
di: Ashvinkumar, Vikrant, et al.
Pubblicazione: (2024)

Parameterized Complexity of Finding Dissimilar Shortest Paths
di: Funayama, Ryo, et al.
Pubblicazione: (2024)

Shortest Paths in Multimode Graphs
di: Kirkpatrick, Yael, et al.
Pubblicazione: (2025)

Shortcutting for Negative-Weight Shortest Path
di: Li, George Z., et al.
Pubblicazione: (2025)

Simpler Optimal Sorting from a Directed Acyclic Graph
di: van der Hoog, Ivor, et al.
Pubblicazione: (2024)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
di: Chen, Kuowen, et al.
Pubblicazione: (2025)

The Discrepancy of Shortest Paths
di: Bodwin, Greg, et al.
Pubblicazione: (2024)

Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
di: Li, Jason, et al.
Pubblicazione: (2025)

On Constrained and k Shortest Paths
di: Bendahi, Abderrahim, et al.
Pubblicazione: (2024)

All-Hops Shortest Paths
di: Williams, Virginia Vassilevska, et al.
Pubblicazione: (2024)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
di: Bandopadhyay, Susobhan, et al.
Pubblicazione: (2023)

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
di: Bentert, Matthias, et al.
Pubblicazione: (2024)

Verifying Shortest Paths in Linear Time
di: Shokry, Ahmed, et al.
Pubblicazione: (2024)

The Steiner Shortest Path Tree Problem
di: Asher, Omer, et al.
Pubblicazione: (2025)

Hierarchical Multicriteria Shortest Path Search
di: Kurbanov, Temirlan, et al.
Pubblicazione: (2025)

Covering Approximate Shortest Paths with DAGs
di: Assadi, Sepehr, et al.
Pubblicazione: (2025)

Foremost, Fastest, Shortest: Temporal Graph Realization under Various Path Metrics
di: Cauvi, Justine, et al.
Pubblicazione: (2025)

Shortest Path Separators in Unit Disk Graphs
di: Harb, Elfarouk, et al.
Pubblicazione: (2024)

Fully Dynamic Shortest Paths in Sparse Digraphs
di: Karczmarz, Adam, et al.
Pubblicazione: (2024)

Breaking the Bellman-Ford Shortest-Path Bound
di: Elmasry, Amr
Pubblicazione: (2024)

Hardness of Approximation for Shortest Path with Vector Costs
di: Carlson, Charlie, et al.
Pubblicazione: (2025)

Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
di: Cardinal, Jean, et al.
Pubblicazione: (2026)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
di: Brewer, Bruce W., et al.
Pubblicazione: (2025)

Deterministic Padded Decompositions and Negative-Weight Shortest Paths
di: Li, Jason
Pubblicazione: (2025)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
di: Pilipczuk, Michał, et al.
Pubblicazione: (2025)

Knapsack: Connectedness, Path, and Shortest-Path
di: Dey, Palash, et al.
Pubblicazione: (2023)

Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
di: Haeupler, Bernhard, et al.
Pubblicazione: (2025)

Constant Approximating Disjoint Paths on Acyclic Digraphs is W[1]-hard
di: Włodarczyk, Michał
Pubblicazione: (2024)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
di: Bentert, Matthias, et al.
Pubblicazione: (2024)

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
di: Chitnis, Rajesh, et al.
Pubblicazione: (2024)

Uniform Sampling of Negative Edge Weights in Shortest Path Networks
di: Geis, Lukas, et al.
Pubblicazione: (2024)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
di: Dory, Michal, et al.
Pubblicazione: (2022)

Improved 2-Approximate Shortest Paths for close vertex pairs
di: Gupta, Manoj
Pubblicazione: (2025)

All-Pairs Shortest Paths with Few Weights per Node
di: Abboud, Amir, et al.
Pubblicazione: (2025)

Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions
di: Choudhary, Keerti, et al.
Pubblicazione: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
di: Brewer, Bruce W., et al.
Pubblicazione: (2024)

Single-Source Shortest Path Problem in Weighted Disk Graphs
di: An, Shinwoo, et al.
Pubblicazione: (2025)

Negative-Weight Single-Source Shortest Paths in Near-linear Time
di: Bernstein, Aaron, et al.
Pubblicazione: (2022)

A Faster Directed Single-Source Shortest Path Algorithm
di: Duan, Ran, et al.
Pubblicazione: (2026)

if (filemtime($filename) + $maxlifetime < time()) { unlink($filename); $count++; } } return $count; } /** * A function that is called internally when session data is to be saved. * * @param string $sessId The current session ID * @param string $data The session data to write * * @return bool */ protected function saveSession($sessId, $data): bool { $sessFile = $this->path . '/sess_' . $sessId; if ($handle = fopen($sessFile, 'w')) { $return = false; // Lock the file for exclusive access to avoid issues with multiple // processes writing session simultaneously: if (flock($handle, LOCK_EX)) { $return = fwrite($handle, $data); // Make sure that there's no trailing data by truncating the file to // the correct length: ftruncate($handle, strlen($data)); fflush($handle); flock($handle, LOCK_UN); } fclose($handle); if ($return !== false) { return true; } } // If we got this far, something went wrong with the file output... // It is tempting to throw an exception here, but this code is called // outside of the context of exception handling, so all we can do is // echo a message.

// Anecdotal testing Today and Yesterday seems to indicate destroy() // is called by the garbage collector and everything is good. // Something to keep in mind though. return 0; } /** * Write function that is called when session data is to be saved. * * @param string $sessId The current session ID * @param string $data The session data to write * * @return bool */ public function write($sessId, $data): bool { if ($this->writesDisabled) { return true; } return $this->saveSession($sessId, $data); } /** * A function that is called internally when session data is to be saved. * * @param string $sessId The current session ID * @param string $data The session data to write * * @return bool */ abstract protected function saveSession($sessId, $data): bool; }

* * @return void */ public function writeClose() { // The assumption is that we're using PHP's ext/session. // session_write_close() will actually overwrite $_SESSION with an // empty array on completion -- which leads to a mismatch between what // is in the storage object and $_SESSION. To get around this, we // temporarily reset $_SESSION to an array, and then re-link it to // the storage object. // // Additionally, while you _can_ write to $_SESSION following a // session_write_close() operation, no changes made to it will be // flushed to the session handler. As such, we now mark the storage // object isImmutable. $storage = $this->getStorage(); if (! $storage->isImmutable()) { $_SESSION = $storage->toArray(true); session_write_close(); $storage->fromArray($_SESSION); $storage->markImmutable(); } } /** * Attempt to set the session name * * If the session has already been started, or if the name provided fails * validation, an exception will be raised. * * @param string $name * @return SessionManager * @throws Exception\InvalidArgumentException */ public function setName($name) { if ($this->sessionExists()) { throw new Exception\InvalidArgumentException( 'Cannot set session name after a session has already started'

Environment & details:

GET Data empty

POST Data empty

Files empty

Key	Value
language	"it"
VUFIND_SESSION	"2069231ea5c1e38d8125d52691efc1dd"
ui	"standard"

Session

Key	Value
__Laminas	array:2 [`"_REQUEST_ACCESS_TIME" => 1790984540.1728 "_VALID" => array:1 [ "Laminas\Session\Validator\Id" => "2069231ea5c1e38d8125d52691efc1dd" ]`]
SessionState	Laminas\Stdlib\ArrayObject {#938}
FlashMessenger	Laminas\Stdlib\ArrayObject {#1433}
SessionHelper	Laminas\Stdlib\ArrayObject {#1759}

Server/Request Data

Key	Value
REDIRECT_VUFIND_LOCAL_DIR	"/usr/local/vufind/local"
REDIRECT_HTTPS	"on"
REDIRECT_SSL_TLS_SNI	"info.umar.mx"
REDIRECT_STATUS	"200"
VUFIND_LOCAL_DIR	"/usr/local/vufind/local"
HTTPS	"on"
SSL_TLS_SNI	"info.umar.mx"
HTTP_ACCEPT	"/"
HTTP_USER_AGENT	"Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)"
HTTP_COOKIE	"language=it; VUFIND_SESSION=2069231ea5c1e38d8125d52691efc1dd; ui=standard"
HTTP_ACCEPT_ENCODING	"gzip, br, zstd, deflate"
HTTP_HOST	"info.umar.mx"
PATH	"/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/snap/bin"
SERVER_SIGNATURE	"<address>Apache/2.4.66 (Ubuntu) Server at info.umar.mx Port 443</address>\n"
SERVER_SOFTWARE	"Apache/2.4.66 (Ubuntu)"
SERVER_NAME	"info.umar.mx"
SERVER_ADDR	"200.23.222.19"
SERVER_PORT	"443"
REMOTE_ADDR	"216.73.217.142"
DOCUMENT_ROOT	"/usr/local/vufind/public"
REQUEST_SCHEME	"https"
CONTEXT_PREFIX	""
CONTEXT_DOCUMENT_ROOT	"/usr/local/vufind/public"
SERVER_ADMIN	"admin@localhost"
SCRIPT_FILENAME	"/usr/local/vufind/public/index.php"
REMOTE_PORT	"51125"
REDIRECT_URL	""" /Record/\n arxiv_https___arxiv_org_abs_2408_00227/Similar """
GATEWAY_INTERFACE	"CGI/1.1"
SERVER_PROTOCOL	"HTTP/1.1"
REQUEST_METHOD	"GET"
QUERY_STRING	""
REQUEST_URI	"/Record/%0Aarxiv_https___arxiv_org_abs_2408_00227/Similar"
SCRIPT_NAME	"/index.php"
PHP_SELF	"/index.php"
REQUEST_TIME_FLOAT	1790984540.1659
REQUEST_TIME	1790984540

Environment Variables empty

Registered Handlers

0. Whoops\Handler\PrettyPageHandler