Sciweavers

    JCO
    2008
    102views more  JCO 2008»
    Stable matching problems with exchange restrictions
    13 years 11 months ago
    Stable matching problems with exchange restrictions
    Download  www.dcs.gla.ac.uk
    We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
    Robert W. Irving
    claim paper
    Read More »
    JCO
    2008
    153views more  JCO 2008»
    A quadratic lower bound for colourful simplicial depth
    13 years 11 months ago
    A quadratic lower bound for colourful simplicial depth
    Download  people.math.sfu.ca
    We show that any point in the convex hull of each of (d + 1) sets of (d + 1) points in Rd is contained in at least (d + 2)2 /4 simplices with one vertex from each set.
    Tamon Stephen, Hugh Thomas
    claim paper
    Read More »
    JCO
    2008
    134views more  JCO 2008»
    On minimum m -connected k -dominating set problem in unit disc graphs
    13 years 11 months ago
    On minimum m -connected k -dominating set problem in unit disc graphs
    Download  www.cs.iit.edu
    Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
    Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
    claim paper
    Read More »
    JCO
    2008
    117views more  JCO 2008»
    Approximation algorithms for connected facility location problems
    13 years 11 months ago
    Approximation algorithms for connected facility location problems
    Download  tclab.kaist.ac.kr
    We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
    Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...
    claim paper
    Read More »
    JCO
    2008
    78views more  JCO 2008»
    Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
    13 years 11 months ago
    Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
    Download  www.dcs.gla.ac.uk
    Robert W. Irving, David Manlove
    claim paper
    Read More »
    JCO
    2008
    84views more  JCO 2008»
    Partitioning a weighted partial order
    13 years 11 months ago
    Partitioning a weighted partial order
    Download  www.econ.kuleuven.be
    The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
    Linda S. Moonen, Frits C. R. Spieksma
    claim paper
    Read More »
    JCO
    2008
    66views more  JCO 2008»
    The hierarchical model for load balancing on two machines
    13 years 11 months ago
    The hierarchical model for load balancing on two machines
    Download  math.haifa.ac.il
    Following previous work, we consider the hierarchical load balancing model on two machines of possibly different speeds. We first focus on maximizing the minimum machine load and ...
    Orion Chassid, Leah Epstein
    claim paper
    Read More »
    JCO
    2008
    63views more  JCO 2008»
    Improved construction for pooling design
    13 years 11 months ago
    Improved construction for pooling design
    Download  www.public.asu.edu
    Ping Deng, Frank K. Hwang, Weili Wu, David MacCall...
    claim paper
    Read More »
    JCO
    2008
    85views more  JCO 2008»
    Locating and detecting arrays for interaction faults
    13 years 11 months ago
    Locating and detecting arrays for interaction faults
    Download  drops.dagstuhl.de
    The identification of interaction faults in component-based systems has focussed on indicating the presence of faults, rather than their location and magnitude. While this is a va...
    Charles J. Colbourn, Daniel W. McClary
    claim paper
    Read More »
    JCO
    2008
    61views more  JCO 2008»
    An exponential (matching based) neighborhood for the vehicle routing problem
    13 years 11 months ago
    An exponential (matching based) neighborhood for the vehicle routing problem
    Download  www-poleia.lip6.fr
    Eric Angel, Evripidis Bampis, Fanny Pascual
    claim paper
    Read More »
    12next ›last »
    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-2024, USA.