Sciweavers

    841 search results - page 8 / 169
    » Approximability of Minimum AND-Circuits
    Sort
    View
    CATS
    2006
    167views Applied Computing» more  CATS 2006»
    On the Approximability of Maximum and Minimum Edge Clique Partition Problems
    14 years 11 months ago
    On the Approximability of Maximum and Minimum Edge Clique Partition Problems
    Download  crpit.com
    We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
    Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
    claim paper
    Read More »
    INFOCOM
    2012
    IEEE
    309views Communications» more  INFOCOM 2012»
    On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
    13 years 2 days ago
    On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
    Download  dclab.cs.nthu.edu.tw
    —In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
    Tung-Wei Kuo, Ming-Jer Tsai
    claim paper
    Read More »
    RANDOM
    1999
    Springer
    105views Theoretical Computer Science» more  RANDOM 1999»
    Approximating Minimum Manhattan Networks
    15 years 1 months ago
    Approximating Minimum Manhattan Networks
    Download  alexandria.tue.nl
    Joachim Gudmundsson, Christos Levcopoulos, Giri Na...
    claim paper
    Read More »
    MFCS
    1998
    Springer
    89views Theoretical Computer Science» more  MFCS 1998»
    Minimum Propositional Proof Length is NP-Hard to Linearly Approximate
    15 years 1 months ago
    Minimum Propositional Proof Length is NP-Hard to Linearly Approximate
    Download  math.ucsd.edu
    Michael Alekhnovich, Samuel R. Buss, Shlomo Moran,...
    claim paper
    Read More »
    47
    Voted
    ESA
    1997
    Springer
    78views Algorithms» more  ESA 1997»
    Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes
    15 years 1 months ago
    Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes
    Download  www.ub.uni-konstanz.de
    Matthias Müller-Hannemann, Karsten Weihe
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.