Local approximations for maximum partial subgraph problem. (Q1426723): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2042951465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for the minimum label spanning tree problem with bounded color classes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an approximation measure founded on the links between optimization and polynomial approximation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations of Weighted Independent Set and Hereditary Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: z-Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Syntactic versus Computational Views of Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation properties of NP minimization classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the Maximum Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation of maximum subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:00, 6 June 2024

scientific article
Language Label Description Also known as
English
Local approximations for maximum partial subgraph problem.
scientific article

    Statements

    Local approximations for maximum partial subgraph problem. (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2004
    0 references
    0 references
    Approximation algorithms
    0 references
    Local search
    0 references
    APX-complete
    0 references
    Maximum subgraph
    0 references
    problem
    0 references
    Minimum vertex deletion problem
    0 references
    Hereditary property
    0 references
    0 references