Image de couverture de livre

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ito, Takehiro, Kakimura, Naonori, Kamiyama, Naoyuki, Kobayashi, Yusuke, Okamoto, Yoshio
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Loss Minimization for Electrical Flows over Spanning Trees on Grids
par: Ito, Takehiro, et autres
Publié: (2024)

Polynomial Kernels with Reachability for Weighted $d$-Matroid Intersection
par: Huang, Chien-Chung, et autres
Publié: (2026)

On Approximating the Weighted Region Problem in Square Tessellations
par: Kakimura, Naonori, et autres
Publié: (2024)

Reconfiguration of labeled matchings in triangular grid graphs
par: Kakimura, Naonori, et autres
Publié: (2024)

Parameterized Complexity of Submodular Minimization under Uncertainty
par: Kakimura, Naonori, et autres
Publié: (2024)

Computing Power Indices in Weighted Majority Games with Formal Power Series
par: Kakimura, Naonori, et autres
Publié: (2025)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
par: Cervenjak, Philip, et autres
Publié: (2026)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
par: DeHaan, Ian, et autres
Publié: (2024)

Simultaneous Network Design with Restricted Link Usage
par: Kakimura, Naonori, et autres
Publié: (2025)

Deterministic Online Bipartite Edge Coloring
par: Blikstad, Joakim, et autres
Publié: (2024)

Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
par: Kuo, Tung-Wei
Publié: (2024)

Parameterized Algorithms for Minimum Sum Vertex Cover
par: Aute, Shubhada, et autres
Publié: (2024)

Biclique Reconfiguration in Bipartite Graphs
par: Otachi, Yota, et autres
Publié: (2026)

Colorful Vertex Recoloring of Bipartite Graphs
par: Patt-Shamir, Boaz, et autres
Publié: (2025)

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs
par: Björklund, Andreas, et autres
Publié: (2023)

Efficient Kernelization Algorithm for Bipartite Graph Matching
par: Wu, Guang, et autres
Publié: (2024)

Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii
par: Friggstad, Zachary, et autres
Publié: (2024)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
par: Adamson, Duncan, et autres
Publié: (2025)

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
par: Peng, Pan, et autres
Publié: (2026)

Scalable Similarity Search over Large Attributed Bipartite Graphs
par: Ou, Xi, et autres
Publié: (2025)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
par: Cai, Xinwei, et autres
Publié: (2023)

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
par: Azarmehr, Amir, et autres
Publié: (2024)

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
par: Das, Syamantak, et autres
Publié: (2024)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
par: Meng, Lingkai, et autres
Publié: (2024)

Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem
par: Kobayashi, Yusuke, et autres
Publié: (2024)

Subquadratic Submodular Maximization with a General Matroid Constraint
par: Kobayashi, Yusuke, et autres
Publié: (2024)

An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
par: Kobayashi, Yusuke, et autres
Publié: (2026)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
par: Ding, Xiangyun, et autres
Publié: (2025)

A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
par: Kwok, Shawxing
Publié: (2025)

Minimum Temporal Spanners in Happy Graphs
par: Casteigts, Arnaud, et autres
Publié: (2026)

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
par: Kiran, Mekala, et autres
Publié: (2026)

Minimum Sum Set Cover: Structures and Algorithm
par: Zhang, Zhongyi, et autres
Publié: (2026)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
par: Ye, Xiaowei, et autres
Publié: (2024)

Connectivity-Preserving Minimum Separator in AT-free Graphs
par: Kenig, Batya
Publié: (2025)

On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
par: Chalermsook, Parinya, et autres
Publié: (2025)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
par: Hathcock, Daniel, et autres
Publié: (2025)

From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
par: Bernstein, Aaron, et autres
Publié: (2025)

Grouped Color Deletion, Lasserre Exactness and Clique-Sum Locality for Rainbow Matching
par: Stamoulis, Georgios
Publié: (2026)

Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs
par: Ahi, Mridul, et autres
Publié: (2025)