Totally-Balanced and Greedy Matrices
From MaRDI portal
Recommendations
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
- Characterizations of totally balanced matrices
- A Class of Balanced Matrices Arising from Location Problems
- scientific article; zbMATH DE number 1285628
- Totally balanced and totally unimodular matrices defined by center location problems
Cites work
- A Class of Balanced Matrices Arising from Location Problems
- Balanced matrices
- Characterizations of strongly chordal graphs
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 3634298 (Why is no real title available?)
Cited in
(91)- \(k\)-tuple domination in graphs
- Improved algorithms for the multicut and multiflow problems in rooted trees
- Characterizations of strongly chordal graphs
- Location problems
- A characterization of totally balanced hypergraphs
- An efficient algorithm for solving a special class of LP's
- Forbidden submatrices
- Totally balanced and totally unimodular matrices defined by center location problems
- Labeling algorithms for domination problems in sun-free chordal graphs
- A note on odd/even cycles
- Search-hide games on trees
- Classes of bipartite graphs related to chordal graphs
- A weighted min-max relation for intervals
- Structural properties and decomposition of linear balanced matrices
- Induced matchings
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- Greedy sets and related problems
- The domatic number problem on some perfect graph families
- Some recent results in the analysis of greedy algorithms for assignment problems
- Solving the uncapacited plant location problem on trees
- A general approach to avoiding two by two submatrices
- Decomposition of balanced matrices
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Greedy oriented flows
- On complexities of minus domination
- An algorithmic framework for tool switching problems with multiple objectives
- Complexity of distance paired-domination problem in graphs
- Optimisation and hypergraph theory
- Solving covering problems and the uncapacitated plant location problem on trees
- Permuting matrices to avoid forbidden submatrices
- Decomposition of wheel-and-parachute-free balanced bipartite graphs
- A note on perfectly orderable graphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Online clustering with variable sized clusters
- The multiple domination and limited packing problems in graphs
- Storage management of items in two levels of availability
- Algorithmic aspects of clique-transversal and clique-independent sets
- Koszul multi-Rees algebras of principal \(L\)-Borel ideals
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths
- Doubly lexical ordering of dense 0--1 matrices
- The one-dimensional Euclidean domain: finitely many obstructions are not enough
- Broadcast domination and multipacking in strongly chordal graphs
- A ranking model for the greedy algorithm and discrete convexity
- Balanced matrices
- Which claw-free graphs are strongly perfect?
- On opposition graphs, coalition graphs, and bipartite permutation graphs
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs
- Rainbow domination and related problems on strongly chordal graphs
- A characterization of the single-crossing domain
- NP-hard graph problems and boundary classes of graphs
- On complexities of minus domination
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs
- Orientation of matrices
- A Class of Balanced Matrices Arising from Location Problems
- Standard graded vertex cover algebras, cycles and leaves
- Steiner trees, connected domination and strongly chordal graphs
- Convexity in Graphs and Hypergraphs
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
- scientific article; zbMATH DE number 1285628 (Why is no real title available?)
- Boundary properties of factorial classes of graphs
- scientific article; zbMATH DE number 7376020 (Why is no real title available?)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs
- How to Secure Matchings Against Edge Failures
- Bipartite Analogues of Comparability and Cocomparability Graphs
- How to Secure Matchings against Edge Failures
- A linear‐time algorithm for broadcast domination in a tree
- Improved approximations for guarding 1.5-dimensional terrains
- What the transportation problem did for me
- MATRIX BALANCING PROBLEM AND BINARY AHP(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Exact solution of two location problems via branch-and-bound
- Strong Chordality of Graphs with Possible Loops
- Large homogeneous submatrices
- An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Dually chordal graphs
- Optimal design of line replaceable units
- Comparability digraphs: an analogue of comparability graphs
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
- Gallai-like characterization of strong cocomparability graphs
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- Monge and feasibility sequences in general flow problems
- Which claw-free graphs are perfectly orderable?
- On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
- On a geometric graph-covering problem related to optimal safety-landing-site location
- On a geometric graph-covering problem related to optimal safety-landing-site location
- Domination, independent domination, and duality in strongly chordal graphs
- Airline crew scheduling: state-of-the-art
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
This page was built for publication: Totally-Balanced and Greedy Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3691772)
