Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings > Dynamic Matching Markets and Voting Paths
Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings |
Lars Arge; Rusins Freivalds
Springer Berlin Heidelberg
Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings
Dynamic Matching Markets and Voting Paths
Authors

David J. Abraham; Telikepalli Kavitha

ARI Id

1664914801306_4053556

Access

Not Available Free

Pages

65-76

DOI

10.1007/11785293_9

Chapter URL

https://rd.springer.com/chapter/10.1007/11785293_9

Table of Contents of Book
Showing 1 to 20 of 41 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily)
Raimund Seidel
1-1
Results and Problems on Self-adjusting Search Trees and Related Data Structures
Robert E. Tarjan
2-2
Classic and Quantum Network Coding
Kazuo Iwama
3-4
Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers
Yossi Azar; Nir Levy
5-16
Scheduling Jobs on Grid Processors
Joan Boyar; Lene M. Favrholdt
17-28
Variable Sized Online Interval Coloring with Bandwidth
Leah Epstein; Thomas Erlebach; Asaf Levin
29-40
A Simpler Linear-Time Recognition of Circular-Arc Graphs
Haim Kaplan; Yahav Nussbaum
41-52
An ${\cal O}(n^{2. 75})$ Algorithm for Online Topological Ordering
Deepak Ajwani; Tobias Friedrich; Ulrich Meyer
53-64
Dynamic Matching Markets and Voting Paths
David J. Abraham; Telikepalli Kavitha
65-76
Sorting by Merging or Merging by Sorting?
Gianni Franceschini
77-89
Finding the Position of the k-Mismatch and Approximate Tandem Repeats
Haim Kaplan; Ely Porat; Nira Shafrir
90-101
Unbiased Matrix Rounding
Benjamin Doerr; Tobias Friedrich; Christian Klein; Ralf Osbild
102-112
Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines
Michael H. Goldwasser; Mark Pedigo
113-123
Paging with Request Sets
Leah Epstein; Rob van Stee; Tami Tamir
124-135
Decentralization and Mechanism Design for Online Machine Scheduling
Birgit Heydenreich; Rudolf Müller; Marc Uetz
136-147
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
Serge Gaspers; Dieter Kratsch; Mathieu Liedloff
148-159
Exact Computation of Maximum Induced Forest
Igor Razgon
160-171
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
Frederic Dorn; Fedor V. Fomin; Dimitrios M. Thilikos
172-183
On the Approximation Hardness of Some Generalizations of TSP
Hans-Joachim Böckenhauer; Juraj Hromkovič; Joachim Kneis; Joachim Kupke
184-195
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 41 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings