Imagen de Portada

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Tan, Jingjing
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Correcting matrix products over the ring of integers
por: Wu, Yu-Lun, et al.
Publicado: (2023)

Sorting with constraints
por: Manas, A.
Publicado: (2025)

Inverse matroid optimization under subset constraints
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Improved Streaming Algorithm for Fair $k$-Center Clustering
por: Guo, Longkun, et al.
Publicado: (2025)

All ascents exponential from valued constraint graphs of pathwidth three
por: Kaznatcheev, Artem, et al.
Publicado: (2026)

Approximation algorithms for non-sequential star packing problems
por: Hu, Mengyuan, et al.
Publicado: (2024)

An approximation algorithm for Maximum DiCut vs. Cut
por: Nakajima, Tamio-Vesa, et al.
Publicado: (2024)

On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
por: Bengali, Vedangi, et al.
Publicado: (2024)

Solving the List Coloring Problem through a Branch-and-Price algorithm
por: Lucci, Mauro, et al.
Publicado: (2023)

Fast approximation algorithms for the 1-median problem on real-world large graphs
por: Ueta, Keisuke, et al.
Publicado: (2025)

A column generation algorithm for finding co-3-plexes in chordal graphs
por: Dupont-Bouillard, Alexandre
Publicado: (2026)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
por: Foucaud, Florent, et al.
Publicado: (2025)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
por: Xiao, Chenglong, et al.
Publicado: (2024)

Parameterised algorithms for temporally satisfying reconfiguration problems
por: Davot, Tom, et al.
Publicado: (2025)

Efficient algorithms for the Potts model on small-set expanders
por: Carlson, Charles, et al.
Publicado: (2020)

Generalising the maximum independent set algorithm via Boolean networks
por: Gadouleau, Maximilien, et al.
Publicado: (2024)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
por: Alecu, Bogdan, et al.
Publicado: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
por: Deák, Bence, et al.
Publicado: (2026)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
por: Korhonen, Tuukka, et al.
Publicado: (2024)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
por: Bernshteyn, Anton, et al.
Publicado: (2024)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
por: Arkhipov, Pavel, et al.
Publicado: (2024)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
por: An, Shinwoo, et al.
Publicado: (2025)

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances
por: Chen, Yu, et al.
Publicado: (2024)

Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families
por: Chen, Yu, et al.
Publicado: (2023)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
por: Oostveen, Jelle J., et al.
Publicado: (2022)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
por: Fei, Yumou, et al.
Publicado: (2025)

An algorithm for accurate and simple-looking metaphorical maps
por: Katsanou, Eleni, et al.
Publicado: (2025)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
por: Harada, Tsubasa
Publicado: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

Generation of weighted trees, block trees and block graphs
por: Ekim, Tınaz, et al.
Publicado: (2024)

Circular-arc graphs and the Helly property
por: Derbisz, Jan, et al.
Publicado: (2024)

Parameterized Saga of First-Fit and Last-Fit Coloring
por: Agrawal, Akanksha, et al.
Publicado: (2024)

Detecting Disjoint Shortest Paths in Linear Time and More
por: Akmal, Shyan, et al.
Publicado: (2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
por: Harada, Tsubasa, et al.
Publicado: (2024)

Deterministic counting from coupling independence
por: Chen, Xiaoyu, et al.
Publicado: (2024)

Stability in Graphs with Matroid Constraints
por: Fomin, Fedor V., et al.
Publicado: (2024)

Generalizing Roberts' characterization of unit interval graphs
por: Martínez, Virginia Ardévol, et al.
Publicado: (2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
por: Kaul, Matthias, et al.
Publicado: (2024)

Reconfiguration of labeled matchings in triangular grid graphs
por: Kakimura, Naonori, et al.
Publicado: (2024)