Pages that link to "Item:Q761351"
From MaRDI portal
The following pages link to Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' (Q761351):
Displaying 35 items.
- Structure of squares and efficient domination in graph classes (Q338382) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
- Duality for balanced submodular flows (Q581206) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- Corrigendum to: ``A heuristic and evolutionary algorithm to optimize the coefficients of curve parametrizations''. (Q739003) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- A family of easy polyhedra (Q1040728) (← links)
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets (Q1147716) (← links)
- Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs (Q1158444) (← links)
- A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (Q1159467) (← links)
- On search over rationals (Q1170866) (← links)
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) (← links)
- Projection algorithms for linear programming (Q1199509) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- The stable fixtures problem with payments (Q1651275) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
- Minimizing submodular functions over families of sets (Q1906848) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Co-density and fractional edge cover packing (Q2175043) (← links)
- Note on separation from membership, and folklore (Q2638377) (← links)
- Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model (Q2682938) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Densities, Matchings, and Fractional Edge-Colorings (Q4620419) (← links)
- Transitive packing (Q4645940) (← links)
- Explicit Near-Ramanujan Graphs of Every Degree (Q5856148) (← links)
- On cycle cones and polyhedra (Q5895283) (← links)
- A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
- (Q6065419) (← links)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)
