On the Approximability of Maximum and Minimum Edge Clique Partition Problems

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Computing: The Australasian Theory Symposium

• Publication date

  2006-01-16

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1142/S0129054107004656
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Algorithms, Theory

  2006cited by this paper
• Approximate Clustering of Fingerprint Vectors with Missing Values

  2005cited by this paper
• Correlation Clustering: maximizing agreements via semidefinite programming

  2004cited by this paper
• Clustering Binary Fingerprint Vectors with Missing Values for DNA Array Data Analysis

  2003cited by this paper
• Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs

  2003cited by this paper
• Clustering with qualitative information

  2003cited by this paper
• Analysis of Bacterial Community Composition by Oligonucleotide Fingerprinting of rRNA Genes

  2002cited by this paper
• Correlation Clustering

  2002cited by this paper
• Cluster graph modification problems

  2002cited by this paper
• Oligonucleotide Fingerprinting of rRNA Genes for Analysis of Fungal Community Composition

  2002influential reference
• Improved Inaproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring

  2001influential reference
• Some optimal inapproximability results

  2001influential reference
• Large-scale clustering of cDNA-fingerprinting data.

  1999cited by this paper
• Gene-representing cDNA clusters defined by hybridization of 57,419 clones from infant brain libraries with short oligonucleotide probes.

  1996cited by this paper
• The Complexity of Multiterminal Cuts

  1994cited by this paper
• Optimization, approximation, and complexity classes

  1991cited by this paper

• Cluster deletion and clique partitioning in graphs with bounded clique number

  2025influential citation
• Algorithms and Complexity of Hedge Cluster Deletion Problems

  2025cites this paper
• Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs

  2025cites this paper
• A Fixed-Parameter Tractable GA for Data Clustering

  2025cites this paper
• Preventing Disinformation Spread Across Network Clusters by Strategic Edge Deletions: a Lagrangian Heuristic

  2025cites this paper
• Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better

  2024cites this paper
• Towards Stronger Lagrangean Bounds for Stable Spanning Trees

  2022cites this paper
• On the Clique Partitioning of a Graph

  2022cites this paper
• Polyhedral results and stronger Lagrangean bounds for stable spanning trees

  2022influential citation
• Indirect identification of horizontal gene transfer

  2020cites this paper
• OMGS: Optical Map-Based Genome Scaffolding

  2019cites this paper
• UNIVERSITY OF CALIFORNIA RIVERSIDE Optical Map-Based Genome Scaffolding A Dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy

  2019influential citation
• Cluster Deletion on Interval Graphs and Split Related Graphs

  2019cites this paper
• Comparing Two Clusterings Using Matchings between Clusters of Clusters

  2019cites this paper
• A Correlation Clustering Framework for Community Detection

  2017cites this paper
• A Formal Transparency Framework for Validation of Real-Time Discrete-Event Control Requirements Modeled by Timed Transition Graphs

  2015cites this paper
• Finding the closest ultrametric

  2015cites this paper
• Complexity of the cluster deletion problem on subclasses of chordal graphs

  2015cites this paper
• Complexity of the cluster deletion problem on chordal graphs, subclasses of chordal graphs, and cographs

  2015cites this paper
• Approximation Algorithms for Clique Clustering

  2014cites this paper
• Online Clique Clustering

  2014cites this paper
• FORMULAÇÕES E ALGORITMOS EXATOS PARA O PROBLEMA DA ÁRVORE GERADORA MÍNIMA COM PARES DE ARESTAS CONFLITANTES

  2014cites this paper
• Competitive Strategies for Online Clique Clustering

  2014cites this paper
• Competitive Online Clique Clustering

  2013cites this paper
• A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number

  2013cites this paper
• The cluster deletion problem for cographs

  2013cites this paper
• A Decomposition Approach for Solving Critical Clique Detection Problems

  2012cites this paper
• Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem

  2012cites this paper
• Quadratic Bottleneck Problems: Algorithms, complexity and related topics.

  2011cites this paper
• The minimum spanning tree problem with conflict constraints and its variations

  2011cites this paper
• Set Covering Problems with General Objective Functions

  2008influential citation