Improved Approximations for the Max k-Colored Clustering Problem (Q3453278): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-18263-6_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W658463892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering on k-Edge-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-existence of stable social groups in information-driven networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-sharing in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:27, 11 July 2024

scientific article
Language Label Description Also known as
English
Improved Approximations for the Max k-Colored Clustering Problem
scientific article

    Statements

    Improved Approximations for the Max k-Colored Clustering Problem (English)
    0 references
    20 November 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    clustering
    0 references
    edge-colored graph
    0 references
    linear relaxation
    0 references
    randomized rounding
    0 references
    worst-case behavior analysis
    0 references
    0 references