A Survey on Covering Supermodular Functions (Q2971606): 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.1007/978-3-540-76796-1_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W183295127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parity problem of polymatroids without double circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc‐disjoint arborescences of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Integer Multiflow Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A THEOREM ON INDEPENDENCE RELATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Submodular Functions on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Network Design with Orientation Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations for Lovász’ Submodular Ideas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Kónig's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parsimonious property of cut covering problems and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the edge set of a directed graph with trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some connectivity properties of Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orientation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures of polyhedra determined by submodular functions on crossing families / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimax theorem on intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polymatroids and submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs on multicommodity flows and cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable networks, linear programming relaxations and the parsimonious property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal edge-coverings of pairs of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph connectivity augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering symmetric supermodular functions by uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An orientation theorem with parity conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined connectivity augmentation and orientation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposing a hypergraph into \(k\) connected sub-hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orientation of graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted \(t\)-matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering intersecting set-systems by digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge splitting and connectivity augmentation in directed hypergraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3617662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3617661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering skew-supermodular functions by hypergraphs of minimum total size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rooted \(k\)-connections in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Problems in Polymatroids Without Double Circuits / rank
 
Normal rank

Latest revision as of 15:20, 13 July 2024

scientific article
Language Label Description Also known as
English
A Survey on Covering Supermodular Functions
scientific article

    Statements

    A Survey on Covering Supermodular Functions (English)
    0 references
    0 references
    0 references
    7 April 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers