• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

The Lazy Matroid Problem

Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T. (2014), The Lazy Matroid Problem, in Diaz, Josep; Lanese, Ivan; Sangiorgi, Davide, Theoretical Computer Science, Springer : Berlin Heidelberg, p. 66-77. 10.1007/978-3-662-44602-7_6

Type
Communication / Conférence
Date
2014
Conference title
8th IFIP TC 1/WG 2.2 International Conference, TCS 2014
Conference date
2014-09
Conference city
Rome
Conference country
Italy
Book title
Theoretical Computer Science
Book author
Diaz, Josep; Lanese, Ivan; Sangiorgi, Davide
Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-662-44601-0
Number of pages
354
Pages
66-77
Publication identifier
10.1007/978-3-662-44602-7_6
Metadata
Show full item record
Author(s)
Gourvès, Laurent
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Monnot, Jérôme cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Pagourtzis, Aris T.
School of Electrical and Computer Engineering, National Technical University of Athens [ICCS]
Abstract (EN)
This article introduces the lazy matroid problem, which captures the goal of saving time or money in certain task selection scenarios. We are given a budget B and a matroid M with weights on its elements. The problem consists in finding an independent set F of minimum weight. In addition, F is feasible if its augmentation with any new element x implies that either F + x exceeds B or F + x is dependent. Our first result is a polynomial time approximation scheme for this NP-hard problem which generalizes a recently studied version of the lazy bureaucrat problem. We next study the approximability of a more general setting called lazy staff matroid. In this generalization, every element of M has a multidimensional weight. We show that approximating this generalization is much harder than for the lazy matroid problem since it includes the independent dominating set problem.
Subjects / Keywords
approximation algorithms; matroids; independent dominating set
JEL
C44 - Operations Research; Statistical Decision Theory

Related items

Showing items related by title and author.

  • Thumbnail
    The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design 
    Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T. (2013) Communication / Conférence
  • Thumbnail
    Algorithmes et mécanismes pour bureaucrates paresseux 
    Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T. (2013) Communication / Conférence
  • Thumbnail
    On the Complexity of the Upper r-Tolerant Edge Cover Problem 
    Harutyunyan, Ararat; Khosravian Ghadikolaei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris (2020) Communication / Conférence
  • Thumbnail
    Extension and its price for the connected vertex cover problem 
    Khosravian Ghadikolaei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris (2019) Communication / Conférence
  • Thumbnail
    Approximation polynomiale pour des problèmes de matroïdes bi-objectifs 
    Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia (2012) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo