• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Approximate solutions of Happynet on cubic graphs

Thumbnail
View/Open
cahierLamsade226.pdf (288.3Kb)
Date
2006
Dewey
Recherche opérationnelle
Sujet
Polynomial algorithm; Graph
Journal issue
Foundations of Computing and Decision Sciences
Volume
31
Number
3-4
Publication date
2006
Article pages
233-242
Publisher
Institute of Computing Science
URI
https://basepub.dauphine.fr/handle/123456789/3705
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Pottié, Olivier
Giannakos, Aristotelis
Type
Article accepté pour publication ou publié
Abstract (EN)
The HAPPYNET problem is defined as follows : Given an undirected simple graph G with integer weights wvu on its edges vu ∈ E(G), find a function s : V(G) → {-1, 1} such that ∀v ∈ V (G), v is happy in G, i.e. such that ∑u∈Γs(v)s(u) wvu ≥ 0. It is easy to see [3] that HAPPYNET has always a solution, no matter what the input is. However, no polynomial algorithm is known for this problem, which is complete for the class PLS (see [4] for a definition). Parberry et al. have shown in [7] that in the case of cubic graphs (i.e. of maximum degree 3) is as difficult as for arbitrary graphs. A ρ-approximate solution to a HAPPYNET instance of size n can be defined for 0 ≤ ρ ≤ 1 as a natural extension of the solution function, with at least ρn happy vertices. In this paper, we present a polynomial-time algorithm that finds a ρ-approximate solution for the HAPPYNET problem on cubic graphs, with ρ ≥ ¾.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.