ALGORITHMICA 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ALGORITHMICA-2010 Paper

click to vote

ALGORITHMICA
2010

192views more ALGORITHMICA 2010»

Circular Stable Matching and 3-way Kidney Transplant

13 years 4 months ago

Download www.mpi-inf.mpg.de

We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...

Chien-Chung Huang

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	192	Circular Stable Matching and 3-way Kidney Transplant	claim
2	188	The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs	claim
3	164	Space Efficient Algorithms for the Burrows-Wheeler Backtransformation	claim
4	159	Computing the Greedy Spanner in Near-Quadratic Time	claim
5	159	Almost Stable Matchings by Truncating the Gale-Shapley Algorithm	claim
6	156	On Covering Problems of Rado	claim
7	155	Bin Packing with Rejection Revisited	claim
8	154	On the Convergence of Multicast Games in Directed Networks	claim
9	153	Confluently Persistent Tries for Efficient Version Control	claim
10	152	Gaming Prediction Markets: Equilibrium Strategies with a Market Maker	claim
11	147	Note on the Structure of Kruskal's Algorithm	claim
12	145	Chordal Deletion is Fixed-Parameter Tractable	claim
13	143	Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks	claim
14	141	Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties	claim
15	141	Compressed Indexes for Approximate String Matching	claim
16	137	Understanding the Generalized Median Stable Matchings	claim
17	137	A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs	claim
18	137	Deciding k-Colorability of P5-Free Graphs in Polynomial Time	claim
19	136	Computing median and antimedian sets in median graphs	claim
20	136	A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems	claim
21	131	A Preemptive Algorithm for Maximizing Disjoint Paths on Trees	claim
22	127	An Algorithm for Minimum Cost Arc-Connectivity Orientations	claim
23	125	On the Fastest Vickrey Algorithm	claim
24	122	Faster Algorithms for Stable Allocation Problems	claim
25	115	Algorithms for Data Migration	claim
26	115	Multi-Color Pebble Motion on Graphs	claim
27	112	Approximation Algorithms for Treewidth	claim
28	112	On Sorting, Heaps, and Minimum Spanning Trees	claim
29	112	On Metric Clustering to Minimize the Sum of Radii	claim
30	111	Three-Sided Stable Matchings with Cyclic Preferences	claim
31	110	Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms	claim
32	108	An Efficient Algorithm for Batch Stability Testing	claim
33	107	Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly	claim
34	107	A Universal Online Caching Algorithm Based on Pattern Matching	claim
35	106	Analysis of the Expected Number of Bit Comparisons Required by Quickselect	claim
36	104	Fixed-Parameter Approximation: Conceptual Framework and Approximability Results	claim
37	99	Collective Tree Spanners in Graphs with Bounded Parameters	claim
38	95	Homogeneous String Segmentation using Trees and Weighted Independent Sets	claim
39	92	Quantum Separation of Local Search and Fixed Point Computation	claim
40	88	Improved Bounds for Wireless Localization	claim
41	86	Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes	claim
42	85	An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem	claim
43	84	Minimum Degree Orderings	claim
44	82	Fractional Path Coloring in Bounded Degree Trees with Applications	claim
45	78	Boundary Labeling with Octilinear Leaders	claim
46	75	In-Place Algorithms for Computing (Layers of) Maxima	claim
47	75	Scheduling Jobs on Grid Processors	claim
48	72	Largest and Smallest Convex Hulls for Imprecise Points	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers