scientific article; zbMATH DE number 3409134
From MaRDI portal
zbMath0258.90032MaRDI QIDQ5675543
Jack Edmonds, Ellis L. Johnson
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The Steiner cycle polytope, On degree sequences of undirected, directed, and bidirected graphs, On the cycle polytope of a binary matroid, Approximation Algorithms for the Traveling Salesman Problem with Range Condition, A connection between Hadamard matrices, oriented hypergraphs and signed graphs, Oriented hypergraphs: balanceability, Linear and combinatorial sharing problems, A separation algorithm for the matchable set polytope, General factors of graphs, Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts, Approximation algorithms for the TSP with sharpened triangle inequality, Approximating minimum-cost graph problems with spanning tree edges, An identity for bipartite matching and symmetric determinant, Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form, On the integral 4-packing of \(T\)-cuts, Free multiflows in bidirected and skew-symmetric graphs, Undirected distances and the postman-structure of graphs, Matrices with the Edmonds-Johnson property, The Schrijver system of odd join polyhedra, The equipartition polytope. I: Formulations, dimension and basic facets, Packings by Complete Bipartite Graphs, Total unimodularity and the Euler-subgraph problem, An extension of the König-Egerváry property to node-weighted bidirected graphs, A polynomial algorithm for b-matchings: An alternative approach, On the diameter of the edge cover polytope, Graph factors and factorization: 1985--2003: a survey, A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem, On the relationship between ATSP and the cycle cover problem, A branch-and-cut algorithm for the equicut problem, A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients, Forest covers and a polyhedral intersection theorem, Subspaces with well-scaled frames, Optimizing over the first Chvátal closure, An algorithmic approach to dual integrality of matching and extensions, On flows in simple bidirected and skew-symmetric networks, Generalizing Kirchhoff laws for Signed Graphs, On generalized matching problems, A unified approach to approximating partial covering problems, Combination algorithms for Steiner tree variants, An oriented hypergraphic approach to algebraic graph theory, Rational and integral \(k\)-regular matrices., Sensitivity theorems in integer linear programming, Another look at the degree constrained subgraph problem, The ellipsoid method and its consequences in combinatorial optimization, Approximately fair cost allocation in metric traveling salesman games, On the transportation problem with market choice, Distributed algorithms for covering, packing and maximum weighted matching, \(b\)-matching degree-sequence polyhedra, An efficient algorithm for minimumk-covers in weighted graphs, Algorithms, Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus, A polyhedral approach to an integer multicommodity flow problem, On cycle cones and polyhedra, The Optimal Design of Low-Latency Virtual Backbones, The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond, ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS, Complete partitions of graphs, Tight integral duality gap in the Chinese postman problem, Unnamed Item, Multicommodity flow in trees: packing via covering and iterated relaxation, My experiences as a student and researcher in OR during the 1960's and 70's, On shortest \(T\)-joins and packing \(T\)-cuts, On the integer-valued variables in the linear vertex packing problem, On the symmetric travelling salesman problem I: Inequalities, Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint), Some simplified NP-complete graph problems, Unnamed Item, Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees, Exact solution approaches for the multi-period degree constrained minimum spanning tree problem, Metabolic networks are NP-hard to reconstruct, Oriented gain graphs, line graphs and eigenvalues, Approximation algorithm for maximum edge coloring, An identity for matching and skew-symmetric determinant, Minimum mean cycle problem in bidirected and skew-symmetric graphs, Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems, Path hitting in acyclic graphs, Fractional matroid matchings, Unnamed Item, \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts, On structures of bisubmodular polyhedra, Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals, On dual integrality in matching problems, A bidirected generalization of network matrices, Spectra of cycle and path families of oriented hypergraphs, Maximum matching of given weight in complete and complete bipartite graphs, The Chvátal closure of generalized stable sets in bidirected graphs, Signed analogue of general Kotzig-Lovász decomposition, Optimum matching forests I: Special weights, Optimum matching forests II: General weights, On matroid parity and matching polytopes, Path problems in skew-symmetric graphs, Virtual private network design over the first Chvátal closure, Engineering Branch-and-Cut Algorithms for the Equicut Problem, Halin graphs and the travelling salesman problem, Network-Based Vertex Dissolution, Approximating minimum-cost connected \(T\)-joins, Matching, Euler tours and the Chinese postman, A 2-approximation algorithm for the minimum weight edge dominating set problem, Packings by cliques and by finite families of graphs, \((p,k)\)-coloring problems in line graphs, Maximum skew-symmetric flows, Approximate core allocations for edge cover games, How many matchings cover the nodes of a graph?, Improved approximation algorithms for minimum power covering problems
