Online Matching on General Graphs Ethan Bernstein Sridhar Rajagopalan CS...  Home/Search
Context
Related
| berkeley.edu/techreport...CSD93757.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/accessP...CSD93757 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we study a variant of the on-line maximum matching problem. Such Supported by an NSF Graduate Fellowship (Update)
Active bibliography (related documents): More All
0.4: Competitive Paging And Dual-Guided On-Line Weighted Caching And.. - Young (1991) (Correct)
0.4: Chapter 12 On-Line Algorithms - In All Of (Correct)
0.2: Discrete Online And Real-Time Optimization - Winter, Zimmermann (1998) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ on-roommates,
author = "Online Matching On",
title = "The Roommates Problem",
url = "citeseer.ist.psu.edu/736467.html" }
Citations (may not include all citations):488 Amortized Efficiency of List Update and Paging Rules (context) - Sleator, Tarjan - 1985
152 Probabilistic computations: Toward a unified measure of comp.. (context) - Yao - 1977
58 An Optimal Algorithm for On-Line Bipartite Matching (context) - Karp, Vazirani et al. - 1990
20 the Power of Randomization in On-Line Algorithms (context) - Ben-David, Borodin et al. - 1990
5 Line Algorithms for Weighted Matching and Stable Marriages (context) - Khuller, Mitchell et al. - 1990
5 Line Weighted Matching (context) - Kalyanasundaram, Pruhs - 1991
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC