Pretraga

Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 613081

A new approach to solve the k-server problem based on network flows and flow cost reduction

Rudec, Tomislav; Manger, Robert
A new approach to solve the k-server problem based on network flows and flow cost reduction // Computers & operations research, 40 (2013), 4; 1004-1013 doi:10.1016/j.cor.2012.11.006 (međunarodna recenzija, članak, znanstveni)

CROSBI ID: 613081 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
A new approach to solve the k-server problem based on network flows and flow cost reduction

Autori
Rudec, Tomislav ; Manger, Robert

Izvornik
Computers & operations research (0305-0548) 40 (2013), 4; 1004-1013

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
on-line problems; k-server problem; optimal off-line algorithm; work function algorithm; implementation; network flows; cost reduction; experiments

Sažetak
This paper is concerned with two algorithms for solving the k-server problem: the optimal off-line algorithm (OPT) and the on-line work function algorithm (WFA). Both algorithms are usually implemented by network flow techniques including the flow augmentation method. In the paper a new implementation approach is proposed, which is again based on network flows, but uses simpler networks and the cost reduction method. The paper describes in detail the corresponding new implementations of OPT and WFA, respectively. All necessary correctness proofs are given. Also, experiments are presented, which confirm that the new approach assures faster execution of both algorithms.

Izvorni jezik
Engleski

Znanstvena područja
Matematika, Računarstvo



POVEZANOST RADA

Projekti:
036-0363078-3018 - Upravljanje mobilnim robotima i vozilima u nepoznatim i dinamičkim okruženjima (Petrović, Ivan, MZO ) ( CroRIS)
037-0362980-2774 - Distribuirani algoritmi za pronalaženje optimalnih putova u grafovima (Manger, Robert, MZOS ) ( CroRIS)

Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb,
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb

Profili:

Avatar Url Tomislav Rudec (autor)

Avatar Url Robert Manger (autor)

Poveznice na cjeloviti tekst rada:

doi www.sciencedirect.com dx.doi.org

Citiraj ovu publikaciju:

Rudec, Tomislav; Manger, Robert
A new approach to solve the k-server problem based on network flows and flow cost reduction // Computers & operations research, 40 (2013), 4; 1004-1013 doi:10.1016/j.cor.2012.11.006 (međunarodna recenzija, članak, znanstveni)
Rudec, T. & Manger, R. (2013) A new approach to solve the k-server problem based on network flows and flow cost reduction. Computers & operations research, 40 (4), 1004-1013 doi:10.1016/j.cor.2012.11.006.
@article{article, author = {Rudec, Tomislav and Manger, Robert}, year = {2013}, pages = {1004-1013}, DOI = {10.1016/j.cor.2012.11.006}, keywords = {on-line problems, k-server problem, optimal off-line algorithm, work function algorithm, implementation, network flows, cost reduction, experiments}, journal = {Computers and operations research}, doi = {10.1016/j.cor.2012.11.006}, volume = {40}, number = {4}, issn = {0305-0548}, title = {A new approach to solve the k-server problem based on network flows and flow cost reduction}, keyword = {on-line problems, k-server problem, optimal off-line algorithm, work function algorithm, implementation, network flows, cost reduction, experiments} }
@article{article, author = {Rudec, Tomislav and Manger, Robert}, year = {2013}, pages = {1004-1013}, DOI = {10.1016/j.cor.2012.11.006}, keywords = {on-line problems, k-server problem, optimal off-line algorithm, work function algorithm, implementation, network flows, cost reduction, experiments}, journal = {Computers and operations research}, doi = {10.1016/j.cor.2012.11.006}, volume = {40}, number = {4}, issn = {0305-0548}, title = {A new approach to solve the k-server problem based on network flows and flow cost reduction}, keyword = {on-line problems, k-server problem, optimal off-line algorithm, work function algorithm, implementation, network flows, cost reduction, experiments} }

Časopis indeksira:


  • Current Contents Connect (CCC)
  • Web of Science Core Collection (WoSCC)
    • Science Citation Index Expanded (SCI-EXP)
    • SCI-EXP, SSCI i/ili A&HCI
  • Scopus

Uključenost u ostale bibliografske baze podataka::


  • INSPEC

Citati:

    Altmetrijski pokazatelji:


    Podijeli:





    Contrast
    Increase Font
    Decrease Font
    Dyslexic Font
    CROSBI koristi kolačiće (cookies) kako bi poboljšao funkcionalnost stranice.