86 search results - page 8 / 18 » soda 2004 |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
How many ways can a rectangle be partitioned into smaller ones? We study two variants of this problem: when the partitions are constrained to lie on n given points (no two of whic...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...