Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities

Keyphrases

• Tight Bounds 100%
• Vertex Capacities 100%
• Online Matching 100%
• Competitive Ratio 100%
• Bounded Degree Graphs 100%
• Matching Problem 66%
• Online Algorithms 66%
• Tight Lower Bound 33%
• Tight Upper Bound 33%
• Capacity Increase 33%
• Bipartite Graph 33%
• Input Model 33%
• Bidders 33%
• Primal-dual Analysis 33%
• Server Capacity 33%
• B-matching 33%
• Vertex Weight 33%
• Individual Capacity 33%
• Probabilistic Input 33%
• Model Matching Problem 33%
• AdWords 33%
• Weight Problems 33%
• Nearly Optimal Solution 33%

Mathematics

• Competitive Ratio 100%
• Matching Problem 100%
• Upper Bound 33%
• Asymptotics 33%
• Lower and upper bounds 33%
• Bipartite Graph 33%

Computer Science

• Competitive Ratio 100%
• on-line algorithm 66%
• Primal-Dual 33%
• Auction Problem 33%
• Matching Model 33%
• Bipartite Graph 33%