Copertina

KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Jin, Mingming, Zheng, Jiongzhi, He, Kun
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Two New Upper Bounds for the Maximum k-plex Problem
di: Zheng, Jiongzhi, et al.
Pubblicazione: (2023)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
di: Xue, Jinghui, et al.
Pubblicazione: (2024)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
di: Luo, Chunyu, et al.
Pubblicazione: (2024)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
di: Wang, Long, et al.
Pubblicazione: (2025)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
di: Hwang, Samuel, et al.
Pubblicazione: (2024)

An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
di: Xu, Xiaojia, et al.
Pubblicazione: (2024)

On the Efficient Discovery of Maximum $k$-Defective Biclique
di: Cui, Donghang, et al.
Pubblicazione: (2025)

Faster Combinatorial k-Clique Algorithms
di: Abboud, Amir, et al.
Pubblicazione: (2024)

A Reduction-based Algorithm for the Clique Interdiction Problem
di: Zhu, Chenghao, et al.
Pubblicazione: (2025)

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

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
di: Fioravantes, Foivos, et al.
Pubblicazione: (2025)

Exact Clique Number Manipulation via Edge Interdiction
di: Zhou, Yi, et al.
Pubblicazione: (2026)

Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
di: Wang, Kaixin, et al.
Pubblicazione: (2023)

On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring
di: El-Hayek, Antoine, et al.
Pubblicazione: (2023)

Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
di: Chang, Lijun
Pubblicazione: (2024)

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
di: Chitnis, Rajesh, et al.
Pubblicazione: (2024)

Optimal (degree+1)-Coloring in Congested Clique
di: Coy, Sam, et al.
Pubblicazione: (2023)

An Exact Algorithm for the Unanimous Vote Problem
di: Keles, Feyza Duman, et al.
Pubblicazione: (2025)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
di: Jang, Jihoon, et al.
Pubblicazione: (2025)

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
di: Cohen-Addad, Vincent, et al.
Pubblicazione: (2025)

Less is More: Faster Maximum Clique Search by Work-Avoidance
di: Vandierendonck, Hans
Pubblicazione: (2025)

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
di: Eisenbrand, Friedrich, et al.
Pubblicazione: (2024)

Computing Maximum Cliques in Unit Disk Graphs
di: Tkachenko, Anastasiia, et al.
Pubblicazione: (2025)

Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts
di: Fischer, Nick, et al.
Pubblicazione: (2026)

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
di: Dhar, Saurav, et al.
Pubblicazione: (2024)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
di: Dalirrooyfard, Mina, et al.
Pubblicazione: (2023)

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
di: Zhou, Yi, et al.
Pubblicazione: (2025)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
di: Madani, Amirali, et al.
Pubblicazione: (2025)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
di: Dai, Han, et al.
Pubblicazione: (2025)

Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
di: Zheng, Da Wei, et al.
Pubblicazione: (2023)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
di: Murakami, Hitoshi, et al.
Pubblicazione: (2024)

New Algorithms and Lower Bounds for Streaming Tournaments
di: Ghosh, Prantar, et al.
Pubblicazione: (2024)

Solving the Multiobjective Quasi-Clique Problem
di: Santos, Daniela Scherer dos, et al.
Pubblicazione: (2024)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
di: Lin, Wenqing, et al.
Pubblicazione: (2025)

Time Efficient Implementation for Online $k$-server Problem on Trees
di: Khadiev, Kamil, et al.
Pubblicazione: (2024)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
di: Ameli, Afrouz Jabal, et al.
Pubblicazione: (2026)

Colorful Priority $k$-Supplier
di: Chekuri, Chandra, et al.
Pubblicazione: (2024)

New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions
di: Jain, Sanjay, et al.
Pubblicazione: (2026)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
di: DeHaan, Ian, et al.
Pubblicazione: (2024)

Maximum Coverage $k$-Antichains and Chains: A Greedy Approach
di: Cáceres, Manuel, et al.
Pubblicazione: (2025)