1368 search results - page 211 / 274 » Generalized Rook Polynomials |
184
click to vote
ACID
2006
15 years 7 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
149
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
144
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
154
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
169
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...