scientific article; zbMATH DE number 1953187

zbMath1024.90505MaRDI QIDQ4414633

Jack Edmonds, Ellis L. Johnson

Publication date: 25 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2570/25700027.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Hierarchical \(b\)-matching, Total graph of a signed graph, On eigenspaces of some compound signed graphs, Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers, Approximating the Minimum Tour Cover with a Compact Linear Program, A greedy algorithm for the social golfer and the Oberwolfach problem, Graph covering using bounded size subgraphs, An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem, Gain-line graphs via \(G\)-phases and group representations, On the Metric $s$--$t$ Path Traveling Salesman Problem, A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem, Optimization with binet matrices, Online Node-weighted Steiner Forest and Extensions via Disk Paintings, Local unimodularity of matrix-vector pairs, On the Metric $s$--$t$ Path Traveling Salesman Problem, Switching Graphs, Edmonds polytopes and a hierarchy of combinatorial problems, Computing a consensus trajectory in a vehicular network