Reoptimization of maximum weight induced hereditary subgraph problems (Q386899): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1016/j.tcs.2012.10.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085587857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of the shortest common superstring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Weighted Graph and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3079180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Steiner trees: changing the terminal set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of the metric deadline TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowing All Optimal Solutions Does Not Help for TSP Reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Reoptimization with Multiple Given Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating maximum independent sets by excluding subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast reoptimization for the minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Clique by Removing Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining minimum spanning trees in dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation of maximum subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with forbidden sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite affine line transitive planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Reoptimization Techniques applied to Steiner Tree Problem / rank
 
Normal rank

Latest revision as of 04:21, 7 July 2024

scientific article
Language Label Description Also known as
English
Reoptimization of maximum weight induced hereditary subgraph problems
scientific article

    Statements

    Reoptimization of maximum weight induced hereditary subgraph problems (English)
    0 references
    0 references
    0 references
    0 references
    11 December 2013
    0 references
    reoptimization
    0 references
    graph theory
    0 references
    polynomial approximation
    0 references
    inapproximability
    0 references
    hereditary property
    0 references
    0 references
    0 references
    0 references

    Identifiers

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