Interdiction problems on planar graphs (Q897609): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1835927266 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1305.1407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Interdiction and Partial Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interdiction policy for a flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on shortest path, assignment, and transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On short paths interdiction problems: Total and node-wise limited interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k most vital arcs in the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network inhibition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On budget-constrained flow improvement. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow interdiction on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching interdiction / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 03:38, 11 July 2024

scientific article
Language Label Description Also known as
English
Interdiction problems on planar graphs
scientific article

    Statements

    Interdiction problems on planar graphs (English)
    0 references
    0 references
    0 references
    7 December 2015
    0 references
    maximum matching
    0 references
    maximum flow
    0 references
    interdiction
    0 references
    planar graphs
    0 references
    crossing gadget
    0 references
    approximation scheme
    0 references

    Identifiers

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