:: Library Catalog

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	de Vos, Tijn, Christiansen, Aleksander B. G.
Format:	Preprint
Veröffentlicht:	2024
Schlagworte:	Data Structures and Algorithms
Online-Zugang:	https://arxiv.org/abs/2405.09141
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Ähnliche Einträge

Dynamic Matroids: Base Packing and Covering
von: de Vos, Tijn, et al.
Veröffentlicht: (2025)

Distributed Sparsest Cut via Eigenvalue Estimation
von: Maus, Yannic, et al.
Veröffentlicht: (2025)

Deterministic Dynamic Edge Colouring
von: Christiansen, Aleksander B. G.
Veröffentlicht: (2024)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
von: Jin, Wenyu, et al.
Veröffentlicht: (2024)

Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
von: Cruciani, Emilio, et al.
Veröffentlicht: (2025)

Deterministic Edge Coloring with few Colors in CONGEST
von: Blikstad, Joakim, et al.
Veröffentlicht: (2026)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
von: Dory, Michal, et al.
Veröffentlicht: (2022)

Sparsity-Parameterised Dynamic Edge Colouring
von: Christiansen, Aleksander B. G., et al.
Veröffentlicht: (2023)

Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
von: Brand, Jan van den, et al.
Veröffentlicht: (2025)

Arboricity-Dependent Algorithms for Edge Coloring
von: Bhattacharya, Sayan, et al.
Veröffentlicht: (2023)

Fast Algorithms for Graph Arboricity and Related Problems
von: Cen, Ruoxu, et al.
Veröffentlicht: (2025)

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
von: Cheng, Yu, et al.
Veröffentlicht: (2024)

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
von: Dai, Jiangqi, et al.
Veröffentlicht: (2025)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
von: Dong, Sally, et al.
Veröffentlicht: (2023)

Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs
von: Zhao, Yibin
Veröffentlicht: (2025)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
von: Chuzhoy, Julia, et al.
Veröffentlicht: (2026)

Faster Pseudo-Deterministic Minimum Cut
von: Kenneth-Mordoch, Yotam
Veröffentlicht: (2026)

Faster Global Minimum Cut with Predictions
von: Moseley, Benjamin, et al.
Veröffentlicht: (2025)

Maintaining $k$-MinHash Signatures over Fully-Dynamic Data Streams with Recovery
von: Clementi, Andrea, et al.
Veröffentlicht: (2024)

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
von: Liu, Yuxi, et al.
Veröffentlicht: (2024)

Private graph colouring with limited defectiveness
von: Christiansen, Aleksander B. G., et al.
Veröffentlicht: (2024)

Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries
von: Bishnu, Arijit, et al.
Veröffentlicht: (2025)

Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
von: Bringmann, Karl, et al.
Veröffentlicht: (2024)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
von: El-Hayek, Antoine, et al.
Veröffentlicht: (2024)

Distributed Santa Claus via Global Rounding
von: de Vos, Tijn, et al.
Veröffentlicht: (2026)

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
von: Kurkure, Yash, et al.
Veröffentlicht: (2024)

Min-Max Connected Multiway Cut
von: Tiwary, Hans Raj, et al.
Veröffentlicht: (2026)

Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow
von: Kenneth-Mordoch, Yotam, et al.
Veröffentlicht: (2025)

Approximating Directed Minimum Cut and Arborescence Packing via Directed Expander Hierarchies
von: Jiang, Yonggang, et al.
Veröffentlicht: (2025)

A tight quasi-polynomial bound for Global Label Min-Cut
von: Jaffke, Lars, et al.
Veröffentlicht: (2022)

Faster Convolutions: Yates and Strassen Revisited
von: Brand, Cornelius, et al.
Veröffentlicht: (2025)

Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time
von: El-Hayek, Antoine, et al.
Veröffentlicht: (2025)

The Power of Migrations in Dynamic Bin Packing
von: Mellou, Konstantina, et al.
Veröffentlicht: (2024)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
von: Iwata, Satoru, et al.
Veröffentlicht: (2024)

iFlow: An Interactive Max-Flow/Min-Cut Algorithms Visualizer
von: Ye, Muyang, et al.
Veröffentlicht: (2024)

Parameterized Critical Node Cut Revisited
von: Knop, Dušan, et al.
Veröffentlicht: (2025)

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
von: Anand, Aditya, et al.
Veröffentlicht: (2025)

Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval
von: Geft, Tzvika, et al.
Veröffentlicht: (2025)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
von: Chuzhoy, Julia, et al.
Veröffentlicht: (2025)

Approximate Min-Sum Subset Convolution
von: Stoian, Mihail
Veröffentlicht: (2024)

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
ui	"standard"
VUFIND_SESSION	"a575e7fa58a8d30e2836268fbb05543c"
language	"de"

Session

Key	Value
__Laminas	array:2 [`"_REQUEST_ACCESS_TIME" => 1784386159.0335 "_VALID" => array:1 [ "Laminas\Session\Validator\Id" => "a575e7fa58a8d30e2836268fbb05543c" ]`]
SessionState	Laminas\Stdlib\ArrayObject {#938}
FlashMessenger	Laminas\Stdlib\ArrayObject {#1583}
SessionHelper	Laminas\Stdlib\ArrayObject {#1772}

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	"ui=standard; VUFIND_SESSION=a575e7fa58a8d30e2836268fbb05543c; language=de"
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.30"
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	"63069"
REDIRECT_URL	""" /Record/\n arxiv_https___arxiv_org_abs_2405_09141/Similar """
GATEWAY_INTERFACE	"CGI/1.1"
SERVER_PROTOCOL	"HTTP/1.1"
REQUEST_METHOD	"GET"
QUERY_STRING	""
REQUEST_URI	"/Record/%0Aarxiv_https___arxiv_org_abs_2405_09141/Similar"
SCRIPT_NAME	"/index.php"
PHP_SELF	"/index.php"
REQUEST_TIME_FLOAT	1784386159.0252
REQUEST_TIME	1784386159

Environment Variables empty

Registered Handlers

0. Whoops\Handler\PrettyPageHandler