A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Co-optimizing application partitioning and network topology for a reconfigurable interconnect

2016
*
Journal of Parallel and Distributed Computing
*

u t h o r s v e r s i o n o f

doi:10.1016/j.jpdc.2016.04.010
fatcat:w3pfy3oepfagfoljr2hqcw4kze
*a*w o r k t h*a*t ... Publication information Journal of Parallel and Distributed Computing, 96 : 12-26 Publisher Elsevier Item record/more information http://hdl.handle.net/10197/9893 Publisher's statement þÿ T h i s i s t h e*a*...*Note*that this approach is similar to*the**one*used in Scotch [14] . We use METIS to*partition**the*two*graphs*. ...##
###
Sparsest cuts and bottlenecks in graphs

1990
*
Discrete Applied Mathematics
*

*The*

*problem*of determining

*a*sparsest cut in

*a*

*graph*is characterized and its computation shown to be NP-hard. ...

*A*class of sparsest cuts, termed

*bottlenecks*, is characterized by

*a*dual relation to

*a*particular polynomial time computable multicommodity flow

*problem*. ... For

*the*

*partition*

*A*,

*A*of V,

*the*cut (

*A*,

*A*) denotes all edges with

*one*end vertex in

*A*and

*the*other in

*A*. ...

##
###
Quantum network routing and local complementation

2019
*
npj Quantum Information
*

Specifically for

doi:10.1038/s41534-019-0191-6
fatcat:wwg525vplvd5re4afj6uopgcxa
*the*two-pair*problem*,*the*butterfly network provides*the*first instance of such an advantage in*a**bottleneck*scenario. ... We finally consider*the**problem*of extracting*graph*states for quantum communication via local Clifford operations and Pauli measurements, and discuss that while*the*general*problem*is known to be NP-complete ... Wehner and*A*. Dahlberg for discussions. Upon completion of this work, we became aware of work similarly motivated 31, 39 ...##
###
Graph Partitioning for Reconfigurable Topology

2012
*
2012 IEEE 26th International Parallel and Distributed Processing Symposium
*

In particular, they helped us build

doi:10.1109/ipdps.2012.80
dblp:conf/ipps/AjwaniAM12
fatcat:son72jccanhf7hqjr6jp5qrcxm
*a*better understanding of*the*optical circuit switches. ... ACKNOWLEDGEMENTS*The*authors are grateful to Kostas Katrinis, Rolf Riesen, Dilma da Silva and Cheng-Hong Li for their valuable feedback. ...*Note*that this approach is similar to*the**one*used in Scotch [16] . We use METIS to*partition**the*two*graphs*. ...##
###
A unified approach to approximation algorithms for bottleneck problems

1986
*
Journal of the ACM
*

Each of

doi:10.1145/5925.5933
fatcat:wbz46e4jurabbaw6c7es74c5cy
*the*algorithms presented here delivers an approximate solution guaranteed to be within*a*constant factor of*the*optimal solution. ... In addition, for several of these*problems*we can show that unless P = NP, there does not exist*a*polynomial-time algorithm that has*a*better performance guarantee. ... Shmoys was supported in part by*the*National Science Foundation by*a*graduate fellowship and under grant MCS 83-l 1422 and in part by DARPA order 403 I, monitored by Naval Electronic System Command under ...##
###
A multi-level bottleneck assignment approach to the bus drivers' rostering problem

1984
*
European Journal of Operational Research
*

This

doi:10.1016/0377-2217(84)90071-7
fatcat:i5chymaysrarribgoncewfl4i4
*problem*is formulated as*a*Multi-level*Bottleneck*Assignment*Problem*(MBA).*The*MBA*problem*is studied: it is shown that it is NP-complete and an asymptotically optimal algorithm is presented. ...*The**problem*of finding*a*work assignment for drivers in*a*given time horizon, in such*a*way as to have an even distribution of*the*workload, is considered. ... It can be*noted*that*the*modified algorithm is actually an algorithm which solves*the**bottleneck*bi-*partite*matching*problem*. ...##
###
Survivable minimum bottleneck networks

2015
*
Computational geometry
*

Our algorithm is based

doi:10.1016/j.comgeo.2015.06.002
fatcat:f7sasho7bje4tka6b7bral4qv4
*on**the*construction of generalised Voronoi diagrams and relative neighbourhood*graphs*. ... We show that*the*survivable*bottleneck*Steiner tree*problem*in normed planes can be solved in polynomial time when*the*number of Steiner points is constant. ...*Note*that this then solves*the*general fixed topology*problem*since any*graph*can be decomposed into full*graphs*which can then be solved independently. ...##
###
Fast, Quality, Segmentation of Large Volumes – Isoperimetric Distance Trees
[chapter]

2006
*
Lecture Notes in Computer Science
*

We propose

doi:10.1007/11744078_35
fatcat:4kavebiafza73nvaqgmpybpaze
*a*new approach based*on**a*novel speed-up of*the*isoperimetric algorithm [1] that can solve*the**problem*of leaks through*a**bottleneck*. ...*The*speed enhancement converts*the*isoperimetric segmentation algorithm to*a*fast, linear-time computation by using*a*tree representation as*the*underlying*graph*instead of*a*standard lattice structure ... In particular, it is known that*the*solution to*the*isoperimetric*problem*often*partitions**the*manifold at*bottleneck*points, as exhibited in Cheeger's classic paper*on**the*subject [21] . ...##
###
Page 4076 of Mathematical Reviews Vol. , Issue 97G
[page]

1997
*
Mathematical Reviews
*

);
Pathria, Anu (1-CA-I; Berkeley, CA)

*The**bottleneck**graph**partition**problem*. ... Summary: “*The**bottleneck**graph**partition**problem*is to parti- tion*the*nodes of*a**graph*into two equally sized sets, so that*the*maximum edge weight in*the*cut separating*the*two sets is mini- mum. ...##
###
On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest

2013
*
2013 IEEE 27th International Symposium on Parallel and Distributed Processing
*

Our evaluation illustrates that processing

doi:10.1109/ipdps.2013.37
dblp:conf/ipps/GharaibehCSR13
fatcat:ygdx5oywkjdb5aggculowgo27e
*a*4-billion edges*graph**on**a*system with*one*CPU socket and*one*GPU, while offloading as little as 25% of*the*edges to*the*GPU, achieves 2x performance improvement ... In particular,*the*workload generated by*a**partitioning*scheme should match*the*strength of*the*processing element*the**partition*is allocated to. ... ACKNOWLEDGMENTS We thank NVIDIA for donating*the*GPU cards used in evaluating this work. ...##
###
Page 668 of Mathematical Reviews Vol. , Issue 95b
[page]

1995
*
Mathematical Reviews
*

When V’ = V,

*the**problem*is called*the*k-*partition**problem*. ... Summary: “In this paper, we study*the**problem*of identifying an optimal biconnected spanning subgraph of an undirected*graph*with respect to*a**bottleneck*objective function. ...##
###
ON BOTTLENECK PARTITIONING OF k-ARY n-CUBES

1996
*
Parallel Processing Letters
*

We desire to

doi:10.1142/s0129626496000376
fatcat:hf2tkvl2tjga3l2mtycdka7uf4
*partition**the**graph*into p node sets, assigned*one*per processor, so as to minimize*the**bottleneck*cost.*The**problem*is not entirely academic. ...*The**problem*of*partitioning**a*communication topology arises, for instance, when*one*executes*a*parallel simulation of tra c*on**a*k-ary n-cube network 7, 1]. ...*Partitioning*of such*graphs*is*a**problem*that arises in network design, and in parallelized simulation of such networks. ...##
###
Improving spanning trees by upgrading nodes
[chapter]

1997
*
Lecture Notes in Computer Science
*

We study

doi:10.1007/3-540-63165-8_185
fatcat:egeorx433nagbkn2lcsbbv64ia
*bottleneck*constra&ed network upgradin 9*problems*. We are given an edge weighted*graph*G = (V,E) where node v E V can be upgraded at*a*cost of c(v). ...*The*performance is measured by*the**bottleneck*weight of*a*minimum spanning tree. ...*The**problem*specifies*a*budget value D*on**the*objective f2.*A*solution x is valid, if it belongs to*the**graph*class 5 e and satisfies*the*constraint f2(x)<~D*on**the*objective f2. ...##
###
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
[article]

2021
*
arXiv
*
pre-print

This paper examines

arXiv:2108.12464v1
fatcat:cq3sqlhqwnfgnlchvafrg6dc2i
*a*generalization of*the**problem*,*the**Bottleneck*Convex Subsets*problem*: given*a*set P of n points in*the*plane and*a*positive integer k, select k pairwise disjoint convex subsets of ... We show*the**problem*is NP-hard when k is an arbitrary input parameter, we give an algorithm that solves*the**problem*exactly, with running time polynomial in n when k is fixed, and we give*a*fixed-parameter ...*Note*that*the**Bottleneck*Convex Subsets*problem*is straightforward to solve for*the*case when k ≥ n/3, i.e.,*one*needs to compute*a*balanced*partition*without worrying about*the*convexity of*the*sets. ...##
###
Approximation Algorithms for the Bottleneck Stretch Factor Problem
[chapter]

2001
*
Lecture Notes in Computer Science
*

stretch factor of

doi:10.1007/3-540-44693-1_44
fatcat:e4yze2vgszbcxeqgeymau2tbh4
*the**graph*G b , which is*the*threshold*graph**on*S containing all edges of length at most b. ...*The*stretch factor of*a*Euclidean*graph*is*the*maximum ratio of*the*distance in*the**graph*between any two points and their Euclidean distance. ...*Note*that m ≤ n 2 . Let G 0 be*the**graph**on*S having no edges. ...
« Previous

*Showing results 1 — 15 out of 30,865 results*