Weighted Upper Edge Cover: Complexity and Approximability (Q5216282): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7155/jgaa.00519 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3005486246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Boundary Property for Upper Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation Bound for Spanning Star Forest and Color Saving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy-Efficient Communication in Multi-interface Wireless Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many facets of upper domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the max min vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for min independent dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted upper domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted independent domination problem is NP-complete for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Spanning Star Forest Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the spanning star forest problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximating bounded variants of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in convex and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lazy bureaucrat scheduling with common deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lazy Matroid Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Variants of the Spanning Star Forest Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation for spanning star forest in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted upper edge cover: complexity and approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended spanning star forest problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximability of extended spanning star forest problems in general and complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More results on weighted independent domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic complexity of twelve covering and independence parameters of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum weight spanning star forest problem on cactus graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enclaveless sets and MK-Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-approximability results for optimization problems on bounded degree instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Minimal Vertex Cover Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 19:40, 21 July 2024

scientific article; zbMATH DE number 7168120
Language Label Description Also known as
English
Weighted Upper Edge Cover: Complexity and Approximability
scientific article; zbMATH DE number 7168120

    Statements

    Weighted Upper Edge Cover: Complexity and Approximability (English)
    0 references
    0 references
    0 references
    0 references
    17 February 2020
    0 references
    weighted version of maximum minimal edge cover
    0 references
    upper edge cover
    0 references
    maximum independent set
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references