About: Minimum Common String Partition Problem: Hardness and Approximations     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
  • V MCSP problému jsou na vstupu dány dva řetězce, které chceme rozsekat do stejné množiny podřetězců, přičemž minimalizujeme počet prvků v této množině. Studujeme slozitost tohoto problemu a popisujeme nekolik aproximacnich algoritmu. (cs)
  • In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimimizing the number of the substrings in the partition. We study the complexity of the problem and describe approximations algorithms.
  • In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimimizing the number of the substrings in the partition. We study the complexity of the problem and describe approximations algorithms. (en)
Title
  • Minimum Common String Partition Problem: Hardness and Approximations
  • Minimum Common String Partition Problem: Hardness and Approximations (en)
  • Problem minimalniho spolecneho deleni retezcu: slozitost a aproximace (cs)
skos:prefLabel
  • Minimum Common String Partition Problem: Hardness and Approximations
  • Minimum Common String Partition Problem: Hardness and Approximations (en)
  • Problem minimalniho spolecneho deleni retezcu: slozitost a aproximace (cs)
skos:notation
  • RIV/00216208:11320/04:00003200!RIV/2005/MSM/113205/N
http://linked.open.../vavai/riv/strany
  • 473;484
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(LN00A056), Z(MSM 113200005)
http://linked.open...iv/cisloPeriodika
  • 3341
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
  • 573728
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/04:00003200
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Minimum;Common;String;Partition;Problem;Hardness;Approximations (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [94C9DC8AA3D5]
http://linked.open...i/riv/nazevZdroje
  • Lecture Notes In Computer Science
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...v/svazekPeriodika
  • 3341
http://linked.open...iv/tvurceVysledku
  • Kolman, Petr
http://linked.open...n/vavai/riv/zamer
issn
  • 0302-9743
number of pages
http://localhost/t...ganizacniJednotka
  • 11320
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software