Cover Image

Sum-of-Max Chain Partition of a Tree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Luo, Ruixi, Zhu, Taikun, Jin, Kai
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Discrete Effort Distribution via Regret-enabled Greedy Algorithm
by: Cao, Song, et al.
Published: (2025)

Simple $k$-crashing Plan with a Good Approximation Ratio
by: Luo, Ruixi, et al.
Published: (2024)

A Faster Algorithm for Pigeonhole Equal Sums
by: Jin, Ce, et al.
Published: (2024)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
by: Sun, Ming, et al.
Published: (2022)

Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
by: Han, Yue, et al.
Published: (2025)

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
by: Ito, Takehiro, et al.
Published: (2025)

Capacitated Partition Vertex Cover and Partition Edge Cover
by: Dabas, Rajni, et al.
Published: (2025)

Robust Max Selection
by: Dang, Trung, et al.
Published: (2024)

Parameterizing Path Partitions
by: Fernau, Henning, et al.
Published: (2022)

Monotone Submodular Multiway Partition
by: Bi, Richard, et al.
Published: (2024)

Graph Partitioning With Limited Moves
by: Behbahani, Majid, et al.
Published: (2024)

Path Partitions of Phylogenetic Networks
by: Lafond, Manuel, et al.
Published: (2024)

Buffered Streaming Edge Partitioning
by: Chhabra, Adil, et al.
Published: (2024)

Partition-based Simple Heaps
by: Brodal, Gerth Stølting, et al.
Published: (2026)

A Lower Bound for the Max Entropy Algorithm for TSP
by: Jin, Billy, et al.
Published: (2023)

Max-Min Diversification with Asymmetric Distances
by: Kumpulainen, Iiro, et al.
Published: (2025)

Max-Cut with Multiple Cardinality Constraints
by: Makarychev, Yury, et al.
Published: (2025)

Streaming Max-Cut in General Metrics
by: Jiang, Shaofeng H. -C., et al.
Published: (2025)

Local Max-Cut on Sparse Graphs
by: Schwartzman, Gregory
Published: (2023)

Max-Distance Sparsification for Diversification and Clustering
by: Kumabe, Soh
Published: (2024)

Distribution Testing Meets Sum Estimation
by: Pradhan, Pinki, et al.
Published: (2025)

Sparsifying Sums of Positive Semidefinite Matrices
by: Basu, Arpon, et al.
Published: (2025)

Approximate Min-Sum Subset Convolution
by: Stoian, Mihail
Published: (2024)

FPT Approximation for Capacitated Sum of Radii
by: Jaiswal, Ragesh, et al.
Published: (2024)

Derandomizing Pseudopolynomial Algorithms for Subset Sum
by: Chan, Timothy M.
Published: (2026)

Beating Bellman's Algorithm for Subset Sum
by: Bringmann, Karl, et al.
Published: (2024)

Faster Edge Coloring by Partition Sieving
by: Akmal, Shyan, et al.
Published: (2025)

A Note on Deterministic FPTAS for Partition
by: Chen, Lin, et al.
Published: (2025)

Weighted Partition Vertex and Edge Cover
by: Dabas, Rajni, et al.
Published: (2025)

Approximating Partition in Near-Linear Time
by: Chen, Lin, et al.
Published: (2024)

Learning Partitions using Rank Queries
by: Chakrabarty, Deeparnab, et al.
Published: (2024)

Tera-Scale Multilevel Graph Partitioning
by: Salwasser, Daniel, et al.
Published: (2024)

Efficiently Coloring the Intersection of a General Matroid and Partition Matroids
by: Arndt, Stephen, et al.
Published: (2025)

Max Cut with Small-Dimensional SDP Solutions
by: Chang, Hsien-Chih, et al.
Published: (2026)

On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
by: Gadekar, Ameet
Published: (2026)

Min-Sum Set Cover on Parallel Machines
by: Szyfelbein, Michał
Published: (2026)

An Improved Pseudopolynomial Time Algorithm for Subset Sum
by: Chen, Lin, et al.
Published: (2024)

FPT approximations for Capacitated Sum of Radii and Diameters
by: Filtser, Arnold, et al.
Published: (2024)

Parameterized Algorithms for Minimum Sum Vertex Cover
by: Aute, Shubhada, et al.
Published: (2024)

Sum Estimation via Vector Similarity Search
by: Mussmann, Stephen, et al.
Published: (2026)