Copertina

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Wang, Chen, Wang, Chao, Gutin, Gregory Z., Zhang, Xiaoyan
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Minimum Sum Set Cover: Structures and Algorithm
di: Zhang, Zhongyi, et al.
Pubblicazione: (2026)

Algorithmic Results for Weak Roman Domination Problem in Graphs
di: Paul, Kaustav, et al.
Pubblicazione: (2024)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
di: DeHaan, Ian, et al.
Pubblicazione: (2025)

Approximation Algorithms for Optimal Hopsets
di: Dinitz, Michael, et al.
Pubblicazione: (2025)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
di: Shakeri, Heman, et al.
Pubblicazione: (2025)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
di: Davies, Sami, et al.
Pubblicazione: (2023)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
di: Liang, Wei, et al.
Pubblicazione: (2024)

An Approximation Algorithm for Monotone Submodular Cost Allocation
di: Mizutani, Ryuhei
Pubblicazione: (2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
di: Veldt, Nate, et al.
Pubblicazione: (2025)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
di: Disser, Yann, et al.
Pubblicazione: (2024)

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

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
di: Mömke, Tobias, et al.
Pubblicazione: (2024)

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

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
di: Nanta, Jiratchaphat, et al.
Pubblicazione: (2025)

Approximately covering vertices by order-$5$ or longer paths
di: Gong, Mingyang, et al.
Pubblicazione: (2024)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems
di: Madathil, Jayakrishnan, et al.
Pubblicazione: (2024)

The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
di: Chen, Yeyuan
Pubblicazione: (2024)

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

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
di: Kita, Nanano
Pubblicazione: (2025)

Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
di: Duvignau, Romaric, et al.
Pubblicazione: (2024)

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

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
di: Abbasi, Ali, et al.
Pubblicazione: (2026)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
di: Gahlawat, Harmender, et al.
Pubblicazione: (2025)

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
di: Efthymiou, Charilaos, et al.
Pubblicazione: (2023)

Stable Approximation Algorithms for Dominating Set and Independent Set
di: de Berg, Mark, et al.
Pubblicazione: (2024)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
di: Bourneuf, Romain, et al.
Pubblicazione: (2025)

EPTAS for Hard Graph Cut Problems for Dense Graphs
di: Deguchi, Kaisei, et al.
Pubblicazione: (2026)

Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
di: Chang, Yen-Hsiang, et al.
Pubblicazione: (2025)

Approximate Realizations for Outerplanaric Degree Sequences
di: Bar-Noy, Amotz, et al.
Pubblicazione: (2024)

Approximating Submodular Matroid-Constrained Partitioning
di: Bérczi, Kristóf, et al.
Pubblicazione: (2025)

(Approximate) Matrix Multiplication via Convolutions
di: Uffenheimer, Yahel, et al.
Pubblicazione: (2025)

An Approximate Generalization of the Okamura-Seymour Theorem
di: Kumar, Nikhil
Pubblicazione: (2022)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
di: Vroon, Mats, et al.
Pubblicazione: (2025)

A Constant-Factor Approximation for Directed Latency
di: Blauth, Jannis, et al.
Pubblicazione: (2025)

Hardness of Burning Number Problem on Regular Graphs
di: Antony, Dhanyamol, et al.
Pubblicazione: (2026)

Approximation of Spanning Tree Congestion using Hereditary Bisection
di: Kolman, Petr
Pubblicazione: (2024)

Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
di: Yang, Puhan, et al.
Pubblicazione: (2025)

Online Graph Coloring for $k$-Colorable Graphs
di: Kawarabayashi, Ken-ichi, et al.
Pubblicazione: (2025)

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

Algorithmic Aspects of Temporal Betweenness
di: Buß, Sebastian, et al.
Pubblicazione: (2020)