Pages that link to "Item:Q3087101"
From MaRDI portal
The following pages link to Iterative Methods in Combinatorial Optimization (Q3087101):
Displaying 50 items.
- On some network design problems with degree constraints (Q355516) (← links)
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
- Degree constrained node-connectivity problems (Q486998) (← links)
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- A unified algorithm for degree bounded survivable network design (Q896300) (← links)
- Network bargaining: using approximate blocking sets to stabilize unstable instances (Q904691) (← links)
- LP-relaxations for tree augmentation (Q1706120) (← links)
- Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
- \(k\)-trails: recognition, complexity, and approximations (Q1800995) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- The minimum degree group Steiner problem (Q2065790) (← links)
- Socially fair network design via iterative rounding (Q2084030) (← links)
- Nearly optimal robust secret sharing against rushing adversaries (Q2102061) (← links)
- A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- On tree-constrained matchings and generalizations (Q2258075) (← links)
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors (Q2281614) (← links)
- Scheduling problems over a network of machines (Q2281619) (← links)
- Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
- The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123) (← links)
- Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- Approximating minimum cost source location problems with local vertex-connectivity demands (Q2434929) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- On fair covering and hitting problems (Q2672421) (← links)
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605) (← links)
- Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
- Arboricity games: the core and the nucleolus (Q2687037) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- k-Trails: Recognition, Complexity, and Approximations (Q3186496) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Approximation Algorithms for Multi-budgeted Network Design Problems (Q3460712) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- Random Walks in Polytopes and Negative Dependence (Q4638105) (← links)
- A Lottery Model for Center-Type Problems With Outliers (Q4972682) (← links)
- A Lottery Model for Center-Type Problems with Outliers (Q5002613) (← links)
- Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
- Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
- (Q5075815) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- (Q5111750) (← links)
- Assortment Optimization Under the Paired Combinatorial Logit Model (Q5130506) (← links)
- (Q5240415) (← links)
- Uniform <i>s</i>-Cross-Intersecting Families (Q5366959) (← links)
