Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Inverse Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an instance of the inverse shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partial inverse minimum spanning tree problem when weight increase is forbidden / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $o(n^3 )$-Time Maximum-Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The base-matroid and inverse combinatorial optimization problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partial inverse minimum cut problem with<i>L</i><sub>1</sub>-norm is strongly NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse combinatorial optimization: a survey on problems, methods, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for constraint partial inverse matroid problem with weight increase forbidden / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial inverse assignment problems under \(l_{1}\) norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the partial inverse matroid problem in which weights can only be increased / rank
 
Normal rank

Latest revision as of 08:16, 15 July 2024

scientific article
Language Label Description Also known as
English
Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
scientific article

    Statements

    Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (English)
    0 references
    0 references
    0 references
    0 references
    13 March 2018
    0 references
    0 references
    partial inverse problem
    0 references
    spanning tree
    0 references
    polynomial time algorithm
    0 references
    computational complexity
    0 references
    0 references