About: Graph balancing: A special case of scheduling unrelated parallel machines     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Článek navrhuje a analyzuje algoritmy a dolní odhady pro vyvažování grafů. Jde o speciální případ rozvrhování nezávislých paralelních počítačů. (cs)
  • We design a 1.75-approximation algorithm for a special case of scheduling parallel machines to minimize the makespan, namely the case where each job can be assigned to at most two machines, which the same processing time on either machine. We also show that even for this special case it is $NP$-hard to compute better than 1.5 approximation.
  • We design a 1.75-approximation algorithm for a special case of scheduling parallel machines to minimize the makespan, namely the case where each job can be assigned to at most two machines, which the same processing time on either machine. We also show that even for this special case it is $NP$-hard to compute better than 1.5 approximation. (en)
Title
  • Graph balancing: A special case of scheduling unrelated parallel machines
  • Graph balancing: A special case of scheduling unrelated parallel machines (en)
  • Vyvažování grafů: Speciální případ rozvrhování nezávislých paralelních počítačů (cs)
skos:prefLabel
  • Graph balancing: A special case of scheduling unrelated parallel machines
  • Graph balancing: A special case of scheduling unrelated parallel machines (en)
  • Vyvažování grafů: Speciální případ rozvrhování nezávislých paralelních počítačů (cs)
skos:notation
  • RIV/67985840:_____/08:00318586!RIV09-AV0-67985840
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/05/0124), P(IAA1019401), Z(AV0Z10190503)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 369603
http://linked.open...ai/riv/idVysledku
  • RIV/67985840:_____/08:00318586
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • graph; graph balancing; scheduling (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [08E276C9A82F]
http://linked.open...v/mistoKonaniAkce
  • San Francisco
http://linked.open...i/riv/mistoVydani
  • San Francisco
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Sgall, Jiří
  • Ebenlendr, Tomáš
  • Krčál, Marek
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • ACM-SIAM
https://schema.org/isbn
  • 978-0-89871-647-4
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software