New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522): 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-642-18381-2_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1602674403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms and Hardness for Domination with Propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive-Closure Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Label Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Steiner Tree with Non-uniform Inflation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power optimization for connectivity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Approximation for Vertex-Connectivity Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:15, 3 July 2024

scientific article
Language Label Description Also known as
English
New Results on the Complexity of the Max- and Min-Rep Problems
scientific article

    Statements

    New Results on the Complexity of the Max- and Min-Rep Problems (English)
    0 references
    0 references
    15 February 2011
    0 references
    0 references
    0 references