scientific article; zbMATH DE number 7053288

zbMath1423.05036MaRDI QIDQ5743409

Konstantin Makarychev, M. I. Sviridenko, Warren Schudy

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095152

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the quadratic minimum spanning tree problem
• Fuzzy quadratic minimum spanning tree problem
• Minimum spanning trees made easier via multi-objective optimization
• Nonlinear bipartite matching
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• An approximation algorithm for the generalized assignment problem
• An effective genetic algorithm approach to the quadratic minimum spanning tree problem
• A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Parametric nonlinear discrete optimization over well-described sets and matroid intersections
• A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
• Approximate Nonlinear Optimization over Weighted Independence Systems
• Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
• Convex quadratic and semidefinite programming relaxations in scheduling
• Nonlinear Matroid Optimization and Experimental Design
• Concentration Inequalities and Martingale Inequalities: A Survey
• A unified approach to scheduling on unrelated parallel machines
• Convex programming for scheduling unrelated parallel machines
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• On the concentration of multivariate polynomials with small expectation
• Concentration of non‐Lipschitz functions and applications
• Advanced Lectures on Machine Learning
• Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
• Concentration of Measure for the Analysis of Randomized Algorithms
• Concentration of multivariate polynomials and its applications

This page was built for publication: