Titlebook: Combinatorial Optimization and Applications; 4th International Co Weili Wu,Ovidiu Daescu Conference proceedings 2010 Springer Berlin Heidel

安装

A Simpler Algorithm for the All Pairs Shortest Path Problem with ,(,,log,) Expected Time,ka. Let the solution set be the set of vertices to which the given algorithm has established shortest paths. The Moffat-Takaoka algorithm maintains complexities before and after the critical point in balance, which is the moment when the size of the solution set is . − ./log.. In this paper, we remo

无畏

New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs,y referred to as an induced matching. In this paper, we show that when . is weakly chordal, the size of the largest induced matching in . is equal to the minimum number of co-chordal subgraphs of . needed to cover the edges of ., and that the co-chordal subgraphs of a minimum cover can be found in p

伦理学

军火

Fast Edge-Searching and Related Problems,hers required to capture the fugitive. In this paper, we consider the problem of finding the minimum number of steps to capture the fugitive. We introduce the fast edge-searching problem in the edge search model, which is the problem of finding the minimum number of steps (called the fast edge-searc

GLUE

Combinatorial Optimization and Applications978-3-642-17461-2Series ISSN 0302-9743 Series E-ISSN 1611-3349

冰雹

Hua Zhang,Li Li,Xiang He,Xingzhen Zhu . “walls”, represented as line segments in the plane. We develop lower and upper bounds for the number of .-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.

使显得不重要

https://doi.org/10.1007/978-3-642-55969-3length is minimum among all .-paths of lengths strictly larger than the shortest path length. In this paper we give an .(|.|log|.| + |.|) time algorithm for this problem, which improves the previous result of .(|.|.) time for sparse graphs.

fulmination

https://doi.org/10.1007/978-3-642-17461-2Blu-ray; algorithms; approximation algorithms; bioinformatics; cloud computing; combinatorial optimizatio

brachial-plexus

978-3-642-17460-5Springer Berlin Heidelberg 2010

娘娘腔