Imagen de Portada

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Luo, Chunyu, Zhou, Yi, Wang, Zhengren, Xiao, Mingyu
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
por: la Tour, Max Dupré, et al.
Publicado: (2024)

KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
por: Jin, Mingming, et al.
Publicado: (2023)

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

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
por: Nguyen, Hue T., et al.
Publicado: (2025)

A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
por: Tian, Kangyi, et al.
Publicado: (2026)

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

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
por: Liu, Yuxi, et al.
Publicado: (2024)

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

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

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
por: Zhao, Jingyang, et al.
Publicado: (2025)

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

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

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
por: Zhao, Jingyang, et al.
Publicado: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
por: Zhao, Jingyang, et al.
Publicado: (2025)

OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
por: Sun, Yiwen, et al.
Publicado: (2024)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
por: Banik, Aritra, et al.
Publicado: (2025)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
por: Zhao, Jingyang, et al.
Publicado: (2025)

Faster Approximation Algorithms for k-Center via Data Reduction
por: Filtser, Arnold, et al.
Publicado: (2025)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
por: Li, Dongyue, et al.
Publicado: (2025)

A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
por: Kwok, Shawxing
Publicado: (2025)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
por: Zhao, Jingyang, et al.
Publicado: (2024)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
por: Xu, Zhenxiang, et al.
Publicado: (2024)

Faster Algorithms for $(2k-1)$-Stretch Distance Oracles
por: Kadria, Avi, et al.
Publicado: (2025)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
por: Zhao, Jingyang, et al.
Publicado: (2026)

A Faster $k$-means++ Algorithm
por: Liang, Jiehao, et al.
Publicado: (2022)

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

Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
por: Han, Yue, et al.
Publicado: (2025)

A Survey on the Densest Subgraph Problem and Its Variants
por: Lanciano, Tommaso, et al.
Publicado: (2023)

Faster Parameterized Vertex Multicut
por: Chu, Huairui, et al.
Publicado: (2026)

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

Learning-Based Algorithms for Graph Searching Problems
por: DePavia, Adela Frances, et al.
Publicado: (2024)

Online Algorithms with Unreliable Guidance
por: Dallot, Julien, et al.
Publicado: (2026)

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

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

Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs
por: Bai, Tian, et al.
Publicado: (2022)

Queueing, Predictions, and LLMs: Challenges and Open Problems
por: Mitzenmacher, Michael, et al.
Publicado: (2025)

Scalable Algorithms for Approximate DNF Model Counting
por: Burkhardt, Paul, et al.
Publicado: (2026)

Enhanced Methods for the Weight Constrained Shortest Path Problem
por: Ahmadi, Saman, et al.
Publicado: (2022)