Recommendations
Cited in
(only showing first 100 items - show all)- Base polyhedra and the linking property
- Path-contractions, edge deletions and connectivity preservation
- Nonlinear combinatorial optimization
- Old and new results on packing arborescences in directed hypergraphs
- Blocking optimal structures
- On orienting graphs for connectivity: Projective planes and Halin graphs
- Subgraph polytopes and independence polytopes of count matroids
- Simple push-relabel algorithms for matroids and submodular flows
- Envy-free matchings with lower quotas
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Complexity of packing common bases in matroids
- Maximum edge-disjoint paths in planar graphs with congestion 2
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
- On the global rigidity of tensegrity graphs
- Packing of mixed hyperarborescences with flexible roots via matroid intersection
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Upper and lower degree-constrained graph orientation with minimum penalty
- Computing in combinatorial optimization
- A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
- Integer plane multiflow maximisation: one-quarter-approximation and gaps
- Decreasing minimization on M-convex sets: background and structures
- Decreasing minimization on M-convex sets: algorithms and applications
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
- A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
- Globally balancing spanning trees
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
- Approximation algorithms for connectivity augmentation problems
- Sparse graphs and an augmentation problem
- Rainbow and monochromatic circuits and cocircuits in binary matroids
- Checking the admissibility of odd-vertex pairings is hard
- Reachability in arborescence packings
- Fair integral submodular flows
- Packing of arborescences with matroid constraints via matroid intersection
- The \(b\)-branching problem in digraphs
- On the fixed-parameter tractability of the maximum connectivity improvement problem
- Eulerian orientations and vertex-connectivity
- Packing of maximal independent mixed arborescences
- A 4+ approximation for k-connected subgraphs
- Matchings under distance constraints. I
- Graded sparse graphs and body-length-direction frameworks
- Minimum weight connectivity augmentation for planar straight-line graphs
- Mechanism design with costly verification and limited punishments
- Polymatroid-based capacitated packing of branchings
- Orientations and detachments of graphs with prescribed degrees and connectivity
- Decomposition into two trees with orientation constraints
- Relay placement for two-connectivity
- Sparse hypergraphs with applications in combinatorial rigidity
- Testing the supermodular-cut condition
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
- A generalized-polymatroid approach to disjoint common independent sets in two matroids
- Packing in generalized kernel systems: a framework that generalizes packing of branchings
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Gain-sparsity and symmetry-forced rigidity in the plane
- Algorithms for finding a rooted \((k,1)\)-edge-connected orientation
- Plane augmentation of plane graphs to meet parity constraints
- Improved approximation algorithms for single-tiered relay placement
- A simple algorithm and min-max formula for the inverse arborescence problem
- Connectivity of orientations of 3-edge-connected graphs
- Analyzing Residual Random Greedy for monotone submodular maximization
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- Covering intersecting bi-set families under matroid constraints
- On maximal independent arborescence packing
- Minimum-cost flow algorithms: an experimental evaluation
- The generalized terminal backup problem
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- An extension of Lehman's theorem and ideal set functions
- On integer network synthesis problem with tree-metric cost
- Stronger bounds and faster algorithms for packing in generalized kernel systems
- Minimum cost globally rigid subgraphs
- Matroids of gain graphs in applied discrete geometry
- Antistrong digraphs
- Connections in combinatorial optimization. I: optimization in graphs
- Graph orientations with set connectivity requirements
- Structured connectivity augmentation
- Minimum cuts and sparsification in hypergraphs
- Submodular functions: learnability, structure, and optimization
- Making bipartite graphs DM-irreducible
- Approximating Minimum Cost Connectivity Orientation and Augmentation
- Discrete convex functions on graphs and their algorithmic applications
- On the tractability of some natural packing, covering and partitioning problems
- Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
- On some interconnections between combinatorial optimization and extremal graph theory
- A faster algorithm for packing branchings in digraphs
- Extended formulations of lower-truncated transversal polymatroids
- On basic operations related to network induction of discrete convex functions
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- Market pricing for matroid rank valuations
- The Steiner Problem for Count Matroids
- Sparse graphs and an augmentation problem
- Globally rigid augmentation of rigid graphs
- A 3/2-Approximation for the Metric Many-Visits Path TSP
- A discrete convex min-max formula for box-TDI polyhedra
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
- Structured connectivity augmentation
- Path-contractions, edge deletions and connectivity preservation
- scientific article; zbMATH DE number 7278072 (Why is no real title available?)
- List coloring of two matroids through reduction to partition matroids
- Supermodularity in unweighted graph optimization. I: Branchings and matchings
- Supermodularity in unweighted graph optimization. II: Matroidal term rank augmentation
- Supermodularity in unweighted graph optimization. III: Highly connected digraphs
This page was built for publication: Connections in combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085455)
