Pages that link to "Item:Q1109690"

The following pages link to A polynomial algorithm for b-matchings: An alternative approach (Q1109690):

Displaying 37 items.

• Constrained multi-object auctions and \(b\)-matching (Q294790) (← links)
• On flows in simple bidirected and skew-symmetric networks (Q415697) (← links)
• A 0.5358-approximation for Bandpass-2 (Q498435) (← links)
• Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
• A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm (Q613330) (← links)
• The cyclical scheduling problem (Q744050) (← links)
• Hierarchical \(b\)-matching (Q831805) (← links)
• Network design with edge-connectivity and degree constraints (Q839639) (← links)
• A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
• Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
• Structural analysis of a fractional matching problem (Q967441) (← links)
• A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem (Q1380926) (← links)
• Matching and multidimensional matching in chordal and strongly chordal graphs (Q1392565) (← links)
• Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
• Tractable combinatorial auctions and \(b\)-matching (Q1614868) (← links)
• 2-balanced flows and the inverse 1-median problem in the Chebyshev space (Q1926492) (← links)
• Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
• Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
• Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems (Q2235745) (← links)
• An algorithmic approach to dual integrality of matching and extensions (Q2419581) (← links)
• Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
• Efficient approximation algorithms for weighted \(b\)-matching (Q2830632) (← links)
• The Medusa algorithm for polynomial matings (Q2842880) (← links)
• The Minimum Spanning <i>k</i>-Core Problem with Bounded CVaR Under Probabilistic Edge Failures (Q3186660) (← links)
• Node-Balancing by Edge-Increments (Q3452807) (← links)
• A Network Structural Approach to the Link Prediction Problem (Q3466771) (← links)
• Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
• (Q3985788) (← links)
• HIGH QUALITY QUADRILATERAL SURFACE MESHING WITHOUT TEMPLATE RESTRICTIONS: A NEW APPROACH BASED ON NETWORK FLOW TECHNIQUES (Q4682188) (← links)
• NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779) (← links)
• ON THE SIGNED MATCHINGS OF GRAPHS (Q5010153) (← links)
• Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
• A Separation Algorithm for <i>b</i>-Matching Degree-Sequence Polyhedra (Q5704115) (← links)
• Integer Programming and Combinatorial Optimization (Q5712453) (← links)
• Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, <i>b</i>-matching, and Unweighted <i>f</i>-factors (Q5858644) (← links)
• Robust two-dose vaccination schemes and the directed \(b\)-matching problem (Q6585275) (← links)
• ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians (Q6633522) (← links)