Robust Matchings

No abstract is available for this paper.

• Publication year

  2002

• Venue

  SIAM Journal on Discrete Mathematics

• Publication date

  2002-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/S0895480198332156
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An Analysis of the Greedy Heuristic for Independence Systems

  1978influential reference

• Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation

  2023cites this paper
• Incremental Maximization via Continuization

  2023influential citation
• Fractionally Subadditive Maximization under an Incremental Knapsack Constraint

  2021influential citation
• Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows

  2021cites this paper
• Scheduling When You Do Not Know the Number of Machines

  2019cites this paper
• Surrogate Optimization for p-Norms

  2019cites this paper
• On the Problem of Assigning PhD Grants

  2019cites this paper
• Some Problems in Graph Theory and Scheduling

  2018cites this paper
• Randomized Strategies for Robust Combinatorial Optimization

  2018cites this paper
• Randomized strategies for cardinality robustness in the knapsack problem

  2017cites this paper
• General bounds for incremental maximization

  2017influential citation
• Algorithm for Maximum Triangle Packing and

  2016cites this paper
• Robust Assignments via Ear Decompositions and Randomized Rounding

  2016cites this paper
• Robust randomized matchings

  2015cites this paper
• Modularity and greed in double auctions

  2014cites this paper
• Packing a Knapsack of Unknown Capacity

  2013cites this paper
• Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints

  2013cites this paper
• A Complete Bibliography of Publications in the SIAM Journal on Discrete Mathematics

  2012cites this paper
• The Power of Recourse in Online Optimization: Robust Solutions for Scheduling, Matroid and MST Problems

  2012cites this paper
• Robust Independence Systems

  2011influential citation
• Computing knapsack solutions with cardinality robustness

  2011influential citation
• MATHEMATICAL ENGINEERING TECHNICAL REPORTS Computing Knapsack Solutions with Cardinality Robustness

  2011cites this paper
• MATHEMATICAL ENGINEERING TECHNICAL REPORTS Robust Independence Systems

  2011cites this paper
• Return of the Boss Problem: Competing Online against a Non-adaptive Adversary

  2010cites this paper
• Robust Matchings and Matroid Intersections

  2010influential citation
• MATHEMATICAL ENGINEERING TECHNICAL REPORTS

  2010cites this paper
• Approximation algorithms for sequencing problems

  2009cites this paper
• Approximation algorithms for maximum latency and partial cycle cover

  2009cites this paper
• On the Maximum Quadratic Assignment Problem

  2009cites this paper
• Robust cost colorings

  2008cites this paper
• Approximation algorithms for NP-hard problems in combinatorial optimization

  2007cites this paper
• Approximation Algorithms for NP-Hard Problems in Combinatorial Optimization

  2007cites this paper
• An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes

  2006cites this paper
• GRAPH PARTITION PROBLEMS WITH MINIMUM SIZE CONSTRAINTS

  2004cites this paper
• Robust subgraphs for trees and paths

  2004cites this paper
• Approximation algorithms for the metric maximum clustering problem with given cluster sizes

  2003cites this paper
• Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs

  2003cites this paper
• Approximating the maximum quadratic assignment problem

  2000cites this paper