Connections in combinatorial optimization
From MaRDI portal
Publication:3085455
Recommendations
Cited in
(only showing first 100 items - show all)- Computing in combinatorial optimization
- On 2-strong connectivity orientations of mixed graphs and related problems
- On the global rigidity of tensegrity graphs
- Mechanism design with costly verification and limited punishments
- Analyzing Residual Random Greedy for monotone submodular maximization
- Packing of arborescences with matroid constraints via matroid intersection
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- On maximal independent arborescence packing
- Supermodularity in unweighted graph optimization. I: Branchings and matchings
- Connectivity of orientations of 3-edge-connected graphs
- List coloring of two matroids through reduction to partition matroids
- A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
- A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
- Decreasing minimization on M-convex sets: background and structures
- Integer plane multiflow maximisation: one-quarter-approximation and gaps
- On the infinite Lucchesi–Younger conjecture I
- Path-contractions, edge deletions and connectivity preservation
- Greedoids from flames
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs
- Approximating Minimum Cost Connectivity Orientation and Augmentation
- Packing in generalized kernel systems: a framework that generalizes packing of branchings
- Upper and lower degree-constrained graph orientation with minimum penalty
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- Complexity of packing common bases in matroids
- Decreasing minimization on M-convex sets: algorithms and applications
- Sparse hypergraphs with applications in combinatorial rigidity
- Globally rigid augmentation of rigid graphs
- 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
- Covering intersecting bi-set families under matroid 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
- 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
- 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
- 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
- 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
- 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
- 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?)
- 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
- Plane augmentation of plane graphs to meet parity constraints
- 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
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)
