Recommendations
Cited in
(only showing first 100 items - show all)- Supermodularity in unweighted graph optimization. III: Highly connected digraphs
- On some interconnections between combinatorial optimization and extremal graph theory
- Envy-free matchings with lower quotas
- Degrees of interior polynomials and parking function enumerators
- Covering intersecting bi-set families under matroid constraints
- Efficient and strategy-proof mechanism under general constraints
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Gain-sparsity and symmetry-forced rigidity in the plane
- Improved approximation algorithms for single-tiered relay placement
- Market pricing for matroid rank valuations
- A discrete convex min-max formula for box-TDI polyhedra
- Rigidity of symmetric frameworks on the cylinder
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
- Connection problems in mountains and monotonic allocation schemes.
- Globally balancing spanning trees
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- Highly connected orientations from edge-disjoint rigid subgraphs
- Minimum cost globally rigid subgraphs
- Partitioning into common independent sets via relaxing strongly base orderability
- Minimum cuts and sparsification in hypergraphs
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
- Polymatroid-based capacitated packing of branchings
- Nonlinear combinatorial optimization
- Finding spanning trees with perfect matchings
- Minimum-cost flow algorithms: an experimental evaluation
- Decomposition into two trees with orientation constraints
- Orientations and detachments of graphs with prescribed degrees and connectivity
- Relay placement for two-connectivity
- FPT algorithms for packing k-safe spanning rooted sub(di)graphs
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
- Discrete convex functions on graphs and their algorithmic applications
- Old and new results on packing arborescences in directed hypergraphs
- On complete classes of valuated matroids
- Rainbow and monochromatic circuits and cocircuits in binary matroids
- M-convexity of vexillary Grothendieck polynomials via bubbling
- Submodular functions: learnability, structure, and optimization
- Algorithms for finding a rooted \((k,1)\)-edge-connected orientation
- 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
- The complexity of 2-vertex-connected orientation in mixed graphs
- Constrained cubic grid rigidity decision with directed graph and applications
- A simple algorithm and min-max formula for the inverse arborescence problem
- Sparse graphs and an augmentation problem
- A network flow approach to a common generalization of Clar and Fries numbers
- Base polyhedra and the linking property
- The generalized terminal backup problem
- Sparse graphs and an augmentation problem
- A 4+ approximation for k-connected subgraphs
- Matchings under distance constraints. I
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
- The \(b\)-branching problem in digraphs
- Structured connectivity augmentation
- Structured connectivity augmentation
- An extension of Lehman's theorem and ideal set functions
- Testing the supermodular-cut condition
- The Steiner Problem for Count Matroids
- On the packing/covering conjecture of infinite matroids
- Matchings under distance constraints. II.
- Eulerian orientations and vertex-connectivity
- On orienting graphs for connectivity: Projective planes and Halin graphs
- Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
- Graph orientations with set connectivity requirements
- Extended formulations of lower-truncated transversal polymatroids
- On Packing Dijoins in Digraphs and Weighted Digraphs
- Approximating maximum-size properly colored forests
- Checking the admissibility of odd-vertex pairings is hard
- Graded sparse graphs and body-length-direction frameworks
- On integer network synthesis problem with tree-metric cost
- scientific article; zbMATH DE number 7278072 (Why is no real title available?)
- Note on Minkowski summation and unimodularity in discrete convex analysis
- Stronger bounds and faster algorithms for packing in generalized kernel systems
- Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
- Maximum edge-disjoint paths in planar graphs with congestion 2
- A faster algorithm for packing branchings in digraphs
- The b‐bibranching problem: TDI system, packing, and discrete convexity
- Monotonic decompositions of submodular set functions
- Plane augmentation of plane graphs to meet parity constraints
- Faster algorithms for rooted connectivity in directed graphs
- Path-contractions, edge deletions and connectivity preservation
- Beating the Integrality Ratio for $s$-$t$-Tours in Graphs
- A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
- Approximation algorithms for connectivity augmentation problems
- Simple push-relabel algorithms for matroids and submodular flows
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Strongly connected orientations and integer lattices
- Minimum weight connectivity augmentation for planar straight-line graphs
- Supermodularity in unweighted graph optimization. II: Matroidal term rank augmentation
- A generalized-polymatroid approach to disjoint common independent sets in two matroids
- On arborescence packing augmentation in hypergraphs
- Packing of mixed hyperarborescences with flexible roots via matroid intersection
- Integral packing of branchings in capacitaded digraphs
- The hypergraph orientation problem with vertex constraints
- Count and cofactor matroids of highly connected graphs
- Popular critical matchings in the many-to-many setting
- On the tractability of some natural packing, covering and partitioning problems
- Approximation algorithms for node and element connectivity augmentation problems
- Strong orientation of a connected graph for a crossing family
- Fair integral submodular flows
- Reachability in arborescence packings
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
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)
