An improved local search based algorithm for $k^-$-star partition

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gong, Mingyang, Lin, Guohui, Mumey, Brendan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approximation algorithms for scheduling with rejection in green manufacturing
by: Gong, Mingyang, et al.
Published: (2025)

Offline green bin packing and its constrained variant
by: Gong, Mingyang, et al.
Published: (2026)

Approximately Partitioning Vertices into Short Paths
by: Gong, Mingyang, et al.
Published: (2026)

Fast Order Statistics with Group Inequality Testing
by: Liyanage, Adiesha, et al.
Published: (2025)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
by: Kanellopoulos, Sotiris, et al.
Published: (2025)

On the satisfability of random k-Horn formulae
by: Istrate, Gabriel
Published: (2000)

Approximation algorithms for Job Scheduling with reconfigurable resources
by: Bergé, Pierre, et al.
Published: (2023)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
by: Blomer, Valentin, et al.
Published: (2026)

A faster algorithm for the construction of optimal factoring automata
by: Erlebach, Thomas, et al.
Published: (2024)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
by: DeHaan, Ian, et al.
Published: (2024)

Faster shortest-path algorithms using the acyclic-connected tree
by: Stefansson, Elis, et al.
Published: (2025)

SARRIGUREN: a polynomial-time complete algorithm for random $k$-SAT with relatively dense clauses
by: Sarriguren, Alfredo Goñi
Published: (2024)

Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
by: Chen, Lin, et al.
Published: (2025)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
by: Kumar, Nikhil, et al.
Published: (2025)

Multiplication of 0-1 matrices via clustering
by: Jansson, Jesper, et al.
Published: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
by: Kowaluk, Mirosław, et al.
Published: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
by: Randolph, Tim, et al.
Published: (2024)

Graph Threading
by: Demaine, Erik D., et al.
Published: (2023)

Guarding Polyominoes Under $k$-Hop Visibility
by: Filtser, Omrit, et al.
Published: (2023)

Towards universally optimal sorting algorithms
by: Sen, Sandeep
Published: (2025)

Faster algorithms on linear delta-matroids
by: Koana, Tomohiro, et al.
Published: (2024)

Online Combinatorial Optimization with Graphical Dependencies
by: Gao, Zhimeng, et al.
Published: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
by: Bruchhold, Sebastian, et al.
Published: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
by: Awofeso, Christine, et al.
Published: (2025)

Online computation of normalized substring complexity
by: Kucherov, Gregory, et al.
Published: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
by: Mosenzon, Ron
Published: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
by: Lindermayr, Alexander, et al.
Published: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
by: Emmerich, Michael
Published: (2025)

Hierarchical Exponential Search Via K-Spines
by: Dong, Bob
Published: (2025)

Simple in-place yet comparison-optimal Mergesort
by: Siebert, Christian
Published: (2025)

Minimizing the Weighted Makespan with Restarts on a Single Machine
by: Amouzandeh, Aflatoun, et al.
Published: (2025)

On Hardness and Approximation of Broadcasting in Structured Graphs
by: Bringolf, Jeffrey, et al.
Published: (2025)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
by: Hommelsheim, Felix, et al.
Published: (2025)

Impact of Knowledge on the Cost of Treasure Hunt in Trees
by: Bouchard, Sébastien, et al.
Published: (2025)

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
by: Duan, Ran, et al.
Published: (2025)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
by: Ahn, Jungho, et al.
Published: (2025)

PtrHash: Minimal Perfect Hashing at RAM Throughput
by: Koerkamp, Ragnar Groot
Published: (2025)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
by: Chuzhoy, Julia, et al.
Published: (2025)

New Sorting Algorithm Wave Sort (W-Sort)
by: Wei, Jia Xu
Published: (2025)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
by: Bauernöppel, Frank, et al.
Published: (2025)