Heuristics for automated knowledge source integration and service composition (Q941554): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Heuristics for automated knowledge source integration and service composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving NP-hard problems in 'almost trees': vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the vertex set of a graph with subgraphs of smaller degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost edge subset covering exactly \(k\) vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph approximation heuristic for the vertex cover problem on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient fixed-parameter algorithms for weighted vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree packing problem in VLSI design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Steiner problems and other variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constrained Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem with hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel local search for Steiner trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for the Steiner tree problem in the Euclidean plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach for the Steiner problem in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the terminal Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong lower bound for the Node Weighted Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic local search in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental analysis of local minima to improve neighbourhood search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank

Revision as of 14:50, 28 June 2024

scientific article
Language Label Description Also known as
English
Heuristics for automated knowledge source integration and service composition
scientific article

    Statements

    Heuristics for automated knowledge source integration and service composition (English)
    0 references
    0 references
    0 references
    0 references
    1 September 2008
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers