Connections in combinatorial optimization
From MaRDI portal
Publication:3085455
zbMATH Open1228.90001MaRDI QIDQ3085455FDOQ3085455
Publication date: 31 March 2011
Recommendations
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Connectivity (05C40)
Cited In (only showing first 100 items - show all)
- 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
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
- Connection problems in mountains and monotonic allocation schemes.
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
- Minimum-cost flow algorithms: an experimental evaluation
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
- The complexity of 2-vertex-connected orientation in mixed graphs
- Old and new results on packing arborescences in directed hypergraphs
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
- 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
- Sparse graphs and an augmentation problem
- Base polyhedra and the linking property
- The \(b\)-branching problem in digraphs
- The Steiner Problem for Count Matroids
- An extension of Lehman's theorem and ideal set functions
- Eulerian orientations and vertex-connectivity
- On orienting graphs for connectivity: Projective planes and Halin graphs
- On Packing Dijoins in Digraphs and Weighted Digraphs
- Graph orientations with set connectivity requirements
- 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
- 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
- Globally Rigid Augmentation of Rigid Graphs
- Integral packing of branchings in capacitaded digraphs
- A generalized-polymatroid approach to disjoint common independent sets in two matroids
- Packing of mixed hyperarborescences with flexible roots via matroid intersection
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
- On the tractability of some natural packing, covering and partitioning problems
- Packing of maximal independent mixed arborescences
- Minimum Cuts and Sparsification in Hypergraphs
- Antistrong digraphs
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Blocking optimal structures
- Subgraph polytopes and independence polytopes of count matroids
- Discrete Convex Functions on Graphs and Their Algorithmic Applications
- Submodular Functions: Learnability, Structure, and Optimization
- Matroids of gain graphs in applied discrete geometry
- On the fixed-parameter tractability of the maximum connectivity improvement problem
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Structured Connectivity Augmentation
- Structured Connectivity Augmentation
- Computing in combinatorial optimization
- Sparse Graphs and an Augmentation Problem
- On the global rigidity of tensegrity graphs
- Mechanism design with costly verification and limited punishments
- Analyzing Residual Random Greedy for monotone submodular maximization
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem
- Title not available (Why is that?)
- On maximal independent arborescence packing
- Packing of arborescences with matroid constraints via matroid intersection
- Connectivity of orientations of 3-edge-connected graphs
- Greedoids from flames
- Path-contractions, edge deletions and connectivity preservation
- 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
- Complexity of packing common bases in matroids
- Sparse hypergraphs with applications in combinatorial rigidity
- Decreasing minimization on M-convex sets: algorithms and applications
- Partitioning into common independent sets via relaxing strongly base orderability
- Globally balancing spanning trees
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
- Polymatroid-based capacitated packing of branchings
- FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs
- Path-Contractions, Edge Deletions and Connectivity Preservation
- Decomposition into two trees with orientation constraints
- Orientations and detachments of graphs with prescribed degrees and connectivity
- Relay placement for two-connectivity
- Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation
- M-convexity of vexillary Grothendieck polynomials via bubbling
- Rainbow and monochromatic circuits and cocircuits in binary matroids
- A network flow approach to a common generalization of Clar and Fries numbers
- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
- Making Bipartite Graphs DM-Irreducible
- A simple algorithm and min-max formula for the inverse arborescence problem
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs
- Matchings under distance constraints. I
- On the packing/covering conjecture of infinite matroids
- Matchings under distance constraints. II.
- Testing the supermodular-cut condition
- Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
- Extended formulations of lower-truncated transversal polymatroids
- Checking the admissibility of odd-vertex pairings is hard
- On integer network synthesis problem with tree-metric cost
- Title not available (Why is that?)
- Graded sparse graphs and body-length-direction frameworks
- Minimum Cost Globally Rigid Subgraphs
- The b‐bibranching problem: TDI system, packing, and discrete convexity
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)
