:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Jeong, Seonghyeon, Wu, Hau-Tieng
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Data Structures and Algorithms 90C26, 90C30 F.2.2; F.2.0; G.4
Accesso online:	https://arxiv.org/abs/2401.17675
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Cluster deletion and clique partitioning in graphs with bounded clique number
di: Galesi, Nicola, et al.
Pubblicazione: (2025)

Approximation algorithms for the prize-collecting rural postman problem
di: Li, Hong, et al.
Pubblicazione: (2026)

Loop unrolling of UCA models: distance labeling
di: Soulignac, Francisco J, et al.
Pubblicazione: (2022)

TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
di: Dau, Son Hoang, et al.
Pubblicazione: (2022)

Modern column generation for estimating single- and multi-purchase ranked list choice models
di: Costa, Luciano, et al.
Pubblicazione: (2026)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
di: Li, Shisheng
Pubblicazione: (2026)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
di: Neira, David E. Bernal, et al.
Pubblicazione: (2021)

A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo
di: Gratton, S., et al.
Pubblicazione: (2026)

An improved approximation algorithm for k-Median
di: Young, Neal E.
Pubblicazione: (2025)

Bicriteria Submodular Maximization
di: Feldman, Moran, et al.
Pubblicazione: (2025)

Efficient Approximation of Fractional Hypertree Width
di: Korchemna, Viktoriia, et al.
Pubblicazione: (2024)

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
di: Klein, Kim-Manuel, et al.
Pubblicazione: (2024)

Stochastic convergence of parallel asynchronous adaptive first-order methods
di: Gratton, Serge, et al.
Pubblicazione: (2026)

A unified worst case for classical simplex and policy iteration pivot rules
di: Disser, Yann, et al.
Pubblicazione: (2023)

Hesse's Redemption: Efficient Convex Polynomial Programming
di: Slot, Lucas, et al.
Pubblicazione: (2025)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
di: Laekhanukit, Bundit
Pubblicazione: (2024)

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"
di: Diaby, Moustapha, et al.
Pubblicazione: (2023)

Discovering Algorithms with Computational Language Processing
di: Bourdais, Theo, et al.
Pubblicazione: (2025)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
di: Gratton, Serge, et al.
Pubblicazione: (2024)

Complexity and performance for two classes of noise-tolerant first-order algorithms
di: Gratton, S., et al.
Pubblicazione: (2022)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
di: Ali, Alejandro Mata
Pubblicazione: (2025)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
di: Hochbaum, Dorit S.
Pubblicazione: (2016)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
di: Aref, Samin, et al.
Pubblicazione: (2025)

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
di: Li, Zijun, et al.
Pubblicazione: (2026)

Simple Approximations for General Spanner Problems
di: Bökler, Fritz, et al.
Pubblicazione: (2025)

Exact Minimum Weight Spanners via Column Generation
di: Bökler, Fritz, et al.
Pubblicazione: (2024)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
di: Chimani, Markus, et al.
Pubblicazione: (2021)

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
di: Foos, Josefine, et al.
Pubblicazione: (2023)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
di: Alimi, Morteza, et al.
Pubblicazione: (2025)

Designing Capacitated Subnetworks for Shortest Path Routing
di: Chimani, Markus, et al.
Pubblicazione: (2026)

Discounted Cuts: A Stackelberg Approach to Network Disruption
di: Drange, Pål Grønås, et al.
Pubblicazione: (2025)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
di: Rockel-Wolff, Benjamin
Pubblicazione: (2024)

Enhancing Model Based Derivative Free Optimization using Direct Search
di: Li, Zijun, et al.
Pubblicazione: (2026)

Learning-Based TSP-Solvers Tend to Be Overly Greedy
di: Li, Xiayang, et al.
Pubblicazione: (2025)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
di: Chen, Yongyu
Pubblicazione: (2023)

On the Complexity of the Bilevel Shortest Path Problem
di: Henke, Dorothee, et al.
Pubblicazione: (2024)

Online Paging with Heterogeneous Cache Slots
di: Chrobak, Marek, et al.
Pubblicazione: (2022)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
di: Feldman, Moran, et al.
Pubblicazione: (2026)