Incremental Medians via Online Bidding

In the k -median problem we are given sets of facilities and customers, and distances between them. For a given set F of facilities, the cost of serving a customer u is the minimum distance between u and a facility in F . The goal is to find a set F of k facilities that minimizes the sum, over all c...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 50; číslo 4; s. 455 - 478
Hlavní autoři:	Chrobak, Marek, Kenyon, Claire, Noga, John, Young, Neal E.
Médium:	Journal Article Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.04.2008 Springer
Témata:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Logistics Mathematics of Computing Operational research and scientific management Operational research. Management science Theoretical computing Theory of Computation Competitive Ratio Incremental Algorithm Facility Location Problem Deterministic Algorithm Fractional Median On line Bidding Refinement method Competitiveness Median Graph theory Polynomial method Approximation algorithm Randomized algorithm Combinatorial optimization Competitive algorithms Polynomial time Optimum Upper bound Randomization Randomized design User service Theorem proving K median problem Minimal distance Metric Deterministic approach Deterministic algorithms
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!