Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
Fuente:
arXiv
Saved in:
| Main Author: | Tan, Jingjing |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Correcting matrix products over the ring of integers
by: Wu, Yu-Lun, et al.
Published: (2023)
by: Wu, Yu-Lun, et al.
Published: (2023)
Sorting with constraints
by: Manas, A.
Published: (2025)
by: Manas, A.
Published: (2025)
Inverse matroid optimization under subset constraints
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
Improved Streaming Algorithm for Fair $k$-Center Clustering
by: Guo, Longkun, et al.
Published: (2025)
by: Guo, Longkun, et al.
Published: (2025)
All ascents exponential from valued constraint graphs of pathwidth three
by: Kaznatcheev, Artem, et al.
Published: (2026)
by: Kaznatcheev, Artem, et al.
Published: (2026)
Approximation algorithms for non-sequential star packing problems
by: Hu, Mengyuan, et al.
Published: (2024)
by: Hu, Mengyuan, et al.
Published: (2024)
An approximation algorithm for Maximum DiCut vs. Cut
by: Nakajima, Tamio-Vesa, et al.
Published: (2024)
by: Nakajima, Tamio-Vesa, et al.
Published: (2024)
On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
by: Bengali, Vedangi, et al.
Published: (2024)
by: Bengali, Vedangi, et al.
Published: (2024)
Solving the List Coloring Problem through a Branch-and-Price algorithm
by: Lucci, Mauro, et al.
Published: (2023)
by: Lucci, Mauro, et al.
Published: (2023)
Fast approximation algorithms for the 1-median problem on real-world large graphs
by: Ueta, Keisuke, et al.
Published: (2025)
by: Ueta, Keisuke, et al.
Published: (2025)
A column generation algorithm for finding co-3-plexes in chordal graphs
by: Dupont-Bouillard, Alexandre
Published: (2026)
by: Dupont-Bouillard, Alexandre
Published: (2026)
Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
by: Foucaud, Florent, et al.
Published: (2025)
by: Foucaud, Florent, et al.
Published: (2025)
An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
by: Xiao, Chenglong, et al.
Published: (2024)
by: Xiao, Chenglong, et al.
Published: (2024)
Parameterised algorithms for temporally satisfying reconfiguration problems
by: Davot, Tom, et al.
Published: (2025)
by: Davot, Tom, et al.
Published: (2025)
Efficient algorithms for the Potts model on small-set expanders
by: Carlson, Charles, et al.
Published: (2020)
by: Carlson, Charles, et al.
Published: (2020)
Generalising the maximum independent set algorithm via Boolean networks
by: Gadouleau, Maximilien, et al.
Published: (2024)
by: Gadouleau, Maximilien, et al.
Published: (2024)
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
by: Alecu, Bogdan, et al.
Published: (2024)
by: Alecu, Bogdan, et al.
Published: (2024)
Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
by: Deák, Bence, et al.
Published: (2026)
by: Deák, Bence, et al.
Published: (2026)
Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
by: Korhonen, Tuukka, et al.
Published: (2024)
by: Korhonen, Tuukka, et al.
Published: (2024)
A linear-time algorithm for $(1+ε)Δ$-edge-coloring
by: Bernshteyn, Anton, et al.
Published: (2024)
by: Bernshteyn, Anton, et al.
Published: (2024)
Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
by: Arkhipov, Pavel, et al.
Published: (2024)
by: Arkhipov, Pavel, et al.
Published: (2024)
An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
by: An, Shinwoo, et al.
Published: (2025)
by: An, Shinwoo, et al.
Published: (2025)
Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances
by: Chen, Yu, et al.
Published: (2024)
by: Chen, Yu, et al.
Published: (2024)
Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families
by: Chen, Yu, et al.
Published: (2023)
by: Chen, Yu, et al.
Published: (2023)
Parameterized Complexity of Streaming Diameter and Connectivity Problems
by: Oostveen, Jelle J., et al.
Published: (2022)
by: Oostveen, Jelle J., et al.
Published: (2022)
Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
by: Fei, Yumou, et al.
Published: (2025)
by: Fei, Yumou, et al.
Published: (2025)
An algorithm for accurate and simple-looking metaphorical maps
by: Katsanou, Eleni, et al.
Published: (2025)
by: Katsanou, Eleni, et al.
Published: (2025)
A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
by: Harada, Tsubasa
Published: (2024)
by: Harada, Tsubasa
Published: (2024)
Exponential Time Approximation for Coloring 3-Colorable Graphs
by: Guruswami, Venkatesan, et al.
Published: (2024)
by: Guruswami, Venkatesan, et al.
Published: (2024)
Generation of weighted trees, block trees and block graphs
by: Ekim, Tınaz, et al.
Published: (2024)
by: Ekim, Tınaz, et al.
Published: (2024)
Circular-arc graphs and the Helly property
by: Derbisz, Jan, et al.
Published: (2024)
by: Derbisz, Jan, et al.
Published: (2024)
Parameterized Saga of First-Fit and Last-Fit Coloring
by: Agrawal, Akanksha, et al.
Published: (2024)
by: Agrawal, Akanksha, et al.
Published: (2024)
Detecting Disjoint Shortest Paths in Linear Time and More
by: Akmal, Shyan, et al.
Published: (2024)
by: Akmal, Shyan, et al.
Published: (2024)
Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
by: Wang, Chen, et al.
Published: (2024)
by: Wang, Chen, et al.
Published: (2024)
A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
by: Harada, Tsubasa, et al.
Published: (2024)
by: Harada, Tsubasa, et al.
Published: (2024)
Deterministic counting from coupling independence
by: Chen, Xiaoyu, et al.
Published: (2024)
by: Chen, Xiaoyu, et al.
Published: (2024)
Stability in Graphs with Matroid Constraints
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Generalizing Roberts' characterization of unit interval graphs
by: Martínez, Virginia Ardévol, et al.
Published: (2024)
by: Martínez, Virginia Ardévol, et al.
Published: (2024)
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
by: Kaul, Matthias, et al.
Published: (2024)
by: Kaul, Matthias, et al.
Published: (2024)
Reconfiguration of labeled matchings in triangular grid graphs
by: Kakimura, Naonori, et al.
Published: (2024)
by: Kakimura, Naonori, et al.
Published: (2024)
Similar Items
-
Correcting matrix products over the ring of integers
by: Wu, Yu-Lun, et al.
Published: (2023) -
Sorting with constraints
by: Manas, A.
Published: (2025) -
Inverse matroid optimization under subset constraints
by: Bérczi, Kristóf, et al.
Published: (2025) -
Improved Streaming Algorithm for Fair $k$-Center Clustering
by: Guo, Longkun, et al.
Published: (2025) -
All ascents exponential from valued constraint graphs of pathwidth three
by: Kaznatcheev, Artem, et al.
Published: (2026)