About: New Results on the Complexity of the Max- and Min-Rep Problems

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: New Results on the Complexity of the Max- and Min-Rep Problems 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	This paper deals with the Max-Rep and Min-Rep problems, both of which are related to the famous Label Cover problem. These are of notable theoretical interest, since they are often used to prove hardness results for other problems. In many cases new complexity results for these problems may be preserved by the reductions, and so new results for Max-Rep and Min-Rep could be applicable to a wide range of other problems as well. Both Max- and Min-Rep are strongly inapproximable. Thus, other approaches are desperately needed to tackle these hard problems. In our paper we use the very successful parameterized complexity paradigm and obtain new complexity results for various parameterizations of the problems. This paper deals with the Max-Rep and Min-Rep problems, both of which are related to the famous Label Cover problem. These are of notable theoretical interest, since they are often used to prove hardness results for other problems. In many cases new complexity results for these problems may be preserved by the reductions, and so new results for Max-Rep and Min-Rep could be applicable to a wide range of other problems as well. Both Max- and Min-Rep are strongly inapproximable. Thus, other approaches are desperately needed to tackle these hard problems. In our paper we use the very successful parameterized complexity paradigm and obtain new complexity results for various parameterizations of the problems. (en)
Title	New Results on the Complexity of the Max- and Min-Rep Problems New Results on the Complexity of the Max- and Min-Rep Problems (en)
skos:prefLabel	New Results on the Complexity of the Max- and Min-Rep Problems New Results on the Complexity of the Max- and Min-Rep Problems (en)
skos:notation	RIV/00216224:14330/11:00065885!RIV14-MSM-14330___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GC201/09/J021), S, Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Ganian, Robert
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	215890
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/11:00065885
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Max-Rep; Min-Rep; Parameterized Complexity (en)
http://linked.open.../riv/klicoveSlovo	Max-Rep Min-Rep Parameterized Complexity
http://linked.open...ontrolniKodProRIV	[7BD1B7778A9D]
http://linked.open...v/mistoKonaniAkce	Nový Smokovec, Slovensko
http://linked.open...i/riv/mistoVydani	Nový Smokovec, Slovensko
http://linked.open...i/riv/nazevZdroje	SOFSEM 2011: Theory and Practice of Computer Science
http://linked.open...in/vavai/riv/obor	BD
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Structural graph theory and parameterized complexity
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Ganian, Robert
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000296264200020
http://linked.open.../riv/zahajeniAkce	2011-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	0302-9743
number of pages	10 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-11266-9_36
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	9783642050053
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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