Optimal $k$-Secretary with Logarithmic Memory

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Qiao, Mingda, Zhang, Wei
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The $k$-Fold Matroid Secretary Problem
di: Gujjar, Rishi, et al.
Pubblicazione: (2025)

Optimal Algorithms for Free Order Multiple-Choice Secretary
di: Hajiaghayi, Mohammad Taghi, et al.
Pubblicazione: (2022)

Logarithmic Approximations for Fair k-Set Selection
di: Li, Shi, et al.
Pubblicazione: (2025)

Computational and Statistical Hardness of Calibration Distance
di: Qiao, Mingda
Pubblicazione: (2026)

Matroid Secretary via Labeling Schemes
di: Bérczi, Kristóf, et al.
Pubblicazione: (2024)

Beating Competitive Ratio 4 for Graphic Matroid Secretary
di: Banihashem, Kiarash, et al.
Pubblicazione: (2025)

Online Prediction with Limited Selectivity
di: Liu, Licheng, et al.
Pubblicazione: (2025)

Limitations of Membership Queries in Testable Learning
di: Lange, Jane, et al.
Pubblicazione: (2025)

On the Distance from Calibration in Sequential Prediction
di: Qiao, Mingda, et al.
Pubblicazione: (2024)

Collaborative Learning with Different Labeling Functions
di: Deng, Yuyang, et al.
Pubblicazione: (2024)

Fair Secretaries with Unfair Predictions
di: Balkanski, Eric, et al.
Pubblicazione: (2024)

Time-Optimal $k$-Server
di: Frei, Fabian, et al.
Pubblicazione: (2025)

No Price Tags? No Problem: Query Strategies for Unpriced Information
di: Nadimpalli, Shivam, et al.
Pubblicazione: (2025)

Sample-Adaptivity Tradeoff in On-Demand Sampling
di: Haghtalab, Nika, et al.
Pubblicazione: (2025)

Optimal-Length Labeling Schemes and Fast Algorithms for k-gathering and k-broadcasting
di: Ganczorz, Adam, et al.
Pubblicazione: (2025)

Dynamic Treewidth in Logarithmic Time
di: Korhonen, Tuukka
Pubblicazione: (2025)

Scalable $k$-clique Densest Subgraph Search
di: Ye, Xiaowei, et al.
Pubblicazione: (2024)

Deterministic $k$-Median Clustering in Near-Optimal Time
di: Costa, Martín, et al.
Pubblicazione: (2025)

On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and $k$-Mismatches
di: Amir, Amihood, et al.
Pubblicazione: (2026)

Truthfulness of Calibration Measures
di: Haghtalab, Nika, et al.
Pubblicazione: (2024)

Additively Competitive Secretaries
di: Mahdian, Mohammad, et al.
Pubblicazione: (2026)

Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation
di: Haeupler, Bernhard, et al.
Pubblicazione: (2025)

Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
di: Chakraborty, Diptarka, et al.
Pubblicazione: (2026)

Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
di: Bhattacharya, Sayan, et al.
Pubblicazione: (2024)

Online List Labeling with Near-Logarithmic Writes
di: Seybold, Martin P.
Pubblicazione: (2024)

Effective Index Construction Algorithm for Optimal $(k,η)$-cores Computation
di: Sun, Shengli, et al.
Pubblicazione: (2025)

A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates
di: Sawettamalya, Pachara, et al.
Pubblicazione: (2025)

Fully Dynamic k-Means Coreset in Near-Optimal Update Time
di: la Tour, Max Dupré, et al.
Pubblicazione: (2024)

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
di: Bhattacharya, Sayan, et al.
Pubblicazione: (2024)

Prophet and Secretary at the Same Time
di: Kehne, Gregory, et al.
Pubblicazione: (2025)

Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds
di: Bansal, Nikhil, et al.
Pubblicazione: (2024)

Nearly Optimal Bounds for Sample-Based Testing and Learning of $k$-Monotone Functions
di: Black, Hadley
Pubblicazione: (2023)

Adaptive Fully Dynamic $k$-Center Clustering with (Near-)Optimal Worst-Case Guarantees
di: Grilnberger, Mara, et al.
Pubblicazione: (2026)

Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
di: Duyster, Anouk, et al.
Pubblicazione: (2025)

Toward Optimal Approximations for Resource-Minimization for Fire Containment on Trees and Non-Uniform k-Center
di: Blauth, Jannis, et al.
Pubblicazione: (2025)

The Secretary Problem with Predicted Additive Gap
di: Braun, Alexander, et al.
Pubblicazione: (2024)

Time, Message and Memory-Optimal Distributed Minimum Spanning Tree and Partwise Aggregation
di: Goldenfeld, Michael Elkin Tanya
Pubblicazione: (2026)

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)
di: Elkin, Michael, et al.
Pubblicazione: (2023)

On $k$-connectivity oracles in $k$-connected graphs
di: Nutov, Zeev
Pubblicazione: (2026)

Prophet Secretary and Matching: the Significance of the Largest Item
di: Chen, Ziyun, et al.
Pubblicazione: (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
VUFIND_SESSION	"d5c7f7b00ed16a6acbd2047a6c635643"
ui	"standard"
language	"it"

Session

Key	Value
__Laminas	array:2 [`"_REQUEST_ACCESS_TIME" => 1790960302.856 "_VALID" => array:1 [ "Laminas\Session\Validator\Id" => "d5c7f7b00ed16a6acbd2047a6c635643" ]`]
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	"VUFIND_SESSION=d5c7f7b00ed16a6acbd2047a6c635643; ui=standard; language=it"
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	"64772"
REDIRECT_URL	""" /Record/\n arxiv_https___arxiv_org_abs_2502_09834/Similar """
GATEWAY_INTERFACE	"CGI/1.1"
SERVER_PROTOCOL	"HTTP/1.1"
REQUEST_METHOD	"GET"
QUERY_STRING	""
REQUEST_URI	"/Record/%0Aarxiv_https___arxiv_org_abs_2502_09834/Similar"
SCRIPT_NAME	"/index.php"
PHP_SELF	"/index.php"
REQUEST_TIME_FLOAT	1790960302.8454
REQUEST_TIME	1790960302

Environment Variables empty

Registered Handlers

0. Whoops\Handler\PrettyPageHandler