Skip to content
Universidad del Mar SIBUMAR Descubridor Institucional UMAR
  • Inicio
  • Búsqueda avanzada
  • Explorar
  • Login
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
Advanced
  • Fairness in the k-Server Problem
Cover Image

Fairness in the k-Server Problem

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Daneshvaramoli, Mohammadreza, Karisani, Helia, Hajiesmaili, Mohammad, Kamali, Shahin, Musco, Cameron
Format: Preprint
Published: 2025
Subjects:
Data Structures and Algorithms
Discrete Mathematics
68W27
F.2.2
Online Access:
Acceder al recurso
Tags: Add Tag
No Tags, Be the first to tag this record!
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Save to List
  • Permanent link
  • Holdings
  • Description
  • Comments
  • Similar Items
  • Staff View

Internet

https://arxiv.org/abs/2512.20960

Similar Items

  • The Secretary Problem with Predictions and a Chosen Order
    by: Karisani, Helia, et al.
    Published: (2026)
  • A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
    by: Sun, Hao
    Published: (2023)
  • The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
    by: Heimann, Sophia, et al.
    Published: (2024)
  • On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
    by: Zhong, Xianghui
    Published: (2019)
  • A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
    by: Heimann, Sophia, et al.
    Published: (2025)
Universidad del Mar
Universidad del MarSistema Bibliotecario de la Universidad del MarDescubridor Institucional UMARImplementación y desarrollo: Mtro. Carlos Alonso Albores Pérez
InicioBúsqueda avanzadaExplorar
Visitas al Descubridor: 33,245© 2026 Universidad del Mar