Sciweavers

    572 search results - page 76 / 115
    » Exponential-Time Approximation of Hard Problems
    Sort
    View
    ICALP
    2010
    Springer
    185views Programming Languages» more  ICALP 2010»
    On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
    15 years 2 months ago
    On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
    Download  www.cc.gatech.edu
    Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
    Venkatesan Guruswami, Rishi Saket
    claim paper
    Read More »
    SPAA
    2010
    ACM
    174views Distributed And Parallel Com...» more  SPAA 2010»
    Scheduling to minimize power consumption using submodular functions
    14 years 10 months ago
    Scheduling to minimize power consumption using submodular functions
    Download  erikdemaine.org
    We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
    Erik D. Demaine, Morteza Zadimoghaddam
    claim paper
    Read More »
    MST
    2006
    149views more  MST 2006»
    Parameterized Intractability of Distinguishing Substring Selection
    14 years 10 months ago
    Parameterized Intractability of Distinguishing Substring Selection
    Download  theinf1.informatik.uni-jena.de
    A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
    Jens Gramm, Jiong Guo, Rolf Niedermeier
    claim paper
    Read More »
    ALENEX
    2009
    106views Algorithms» more  ALENEX 2009»
    Drawing Binary Tanglegrams: An Experimental Evaluation
    14 years 11 months ago
    Drawing Binary Tanglegrams: An Experimental Evaluation
    Download  www.win.tue.nl
    A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
    Martin Nöllenburg, Markus Völker, Alexan...
    claim paper
    Read More »
    TON
    2008
    99views more  TON 2008»
    On the computational complexity and effectiveness of N-hub shortest-path routing
    14 years 10 months ago
    On the computational complexity and effectiveness of N-hub shortest-path routing
    Download  www.ieee-infocom.org
    Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
    Reuven Cohen, Gabi Nakibly
    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.