ISAAC 2004 - PDF Preprint Papers

ISAAC 2004 International Symposium on Algorithms and Computation

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ISAAC-2004 Paper

click to vote

ISAAC
2004
Springer

207views Algorithms» more ISAAC 2004»

Pareto Optimality in House Allocation Problems

14 years 5 months ago

Download www.cs.cmu.edu

We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for ﬁnding a maxim...

David J. Abraham, Katarína Cechlárov...

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	207	Pareto Optimality in House Allocation Problems	claim
2	170	Spanners, Weak Spanners, and Power Spanners for Wireless Networks	claim
3	153	Canonical Data Structure for Interval Probe Graphs	claim
4	142	On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem	claim
5	141	Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation	claim
6	137	The Polymatroid Steiner Problems	claim
7	135	Geometric Optimization Problems Over Sliding Windows	claim
8	127	Efficient Algorithms for the Longest Path Problem	claim
9	125	Polyline Fitting of Planar Points Under Min-sum Criteria	claim
10	125	Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs	claim
11	121	Approximate Distance Oracles for Graphs with Dense Clusters	claim
12	117	Adaptive Spatial Partitioning for Multidimensional Data Streams	claim
13	115	Multicriteria Global Minimum Cuts	claim
14	115	Puzzles, Art, and Magic with Algorithms	claim
15	115	Randomized Algorithms for Motif Detection	claim
16	114	Structural Alignment of Two RNA Sequences with Lagrangian Relaxation	claim
17	112	Guarding Art Galleries by Guarding Witnesses	claim
18	112	Dynamic Tree Cross Products	claim
19	107	On the Hardness and Easiness of Random 4-SAT Formulas	claim
20	106	Minimum Common String Partition Problem: Hardness and Approximations	claim
21	105	On the Monotone Circuit Complexity of Quadratic Boolean Functions	claim
22	103	Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)	claim
23	102	On-Line Windows Scheduling of Temporary Items	claim
24	102	Polynomial Deterministic Rendezvous in Arbitrary Graphs	claim
25	100	Boundary-Optimal Triangulation Flooding	claim
26	98	Inner Rectangular Drawings of Plane Graphs	claim
27	96	Many-to-many Disjoint Path Covers in a Graph with Faulty Elements	claim
28	95	Flexibility of Steiner Trees in Uniform Orientation Metrics	claim
29	94	Superimposing Voronoi Complexes for Shape Deformation	claim
30	94	Error Compensation in Leaf Root Problems	claim
31	93	A Generalization of Magic Squares with Applications to Digital Halftoning	claim
32	92	Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs	claim
33	91	Techniques for Indexing and Querying Temporal Observations for a Collection of Objects	claim
34	88	On the Range Maximum-Sum Segment Query Problem	claim
35	88	The Maximum Agreement of Two Nested Phylogenetic Networks	claim
36	87	Random Access to Advice Strings and Collapsing Results	claim
37	84	Property-Preserving Data Reconstruction	claim
38	79	Paired Pointset Traversal	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers