Sciweavers

    3415 search results - page 95 / 683
    » Lower Bounds for Kernelizations
    Sort
    View
    76
    Voted
    JC
    2006
    57views more  JC 2006»
    A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer
    15 years 23 days ago
    A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer
    Download  www.cs.columbia.edu
    Arvid J. Bessen
    claim paper
    Read More »
    72
    Voted
    ECCC
    2007
    61views more  ECCC 2007»
    The Pattern Matrix Method for Lower Bounds on Quantum Communication
    15 years 23 days ago
    The Pattern Matrix Method for Lower Bounds on Quantum Communication
    Download  www.cs.ust.hk
    Alexander A. Sherstov
    claim paper
    Read More »
    96
    Voted
    EOR
    2007
    76views more  EOR 2007»
    Lower bounds and heuristics for the Windy Rural Postman Problem
    15 years 23 days ago
    Lower bounds and heuristics for the Windy Rural Postman Problem
    Download  www.uv.es
    In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routin...
    Enrique Benavent, Alessandro Carrotta, Angel Corbe...
    claim paper
    Read More »
    104
    Voted
    NETWORKS
    2008
    208views Computer Networks» more  NETWORKS 2008»
    Competitive algorithms and lower bounds for online randomized call control in cellular networks
    15 years 23 days ago
    Competitive algorithms and lower bounds for online randomized call control in cellular networks
    Download  www.ceid.upatras.gr
    Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
    claim paper
    Read More »
    NETWORKS
    2006
    111views Computer Networks» more  NETWORKS 2006»
    Lower bounds for the relative greedy algorithm for approximating Steiner trees
    15 years 23 days ago
    Lower bounds for the relative greedy algorithm for approximating Steiner trees
    Download  www.matheon.de
    Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
    Stefan Hougardy, Stefan Kirchner
    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-2026, USA.