Filters








16,291 Hits in 8.2 sec

The complexity of multiway cuts (extended abstract)

E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, M. Yannakakis
1992 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92  
We also describe a simple approximation slgorithnt for arbkmry graphs that is guaranteed to come within a fsctor of 2-2/k of the optimal cut weight.  ...  In the Multiway Cut problem we are given an edgaweighted graph and a subset of the vertices called termimds, and asked for a minimum weight set of edges that separates each terminal from all the others  ...  Hu [14,p.150] with the minimization of communication costs in parallel computing systems.  ... 
doi:10.1145/129712.129736 dblp:conf/stoc/DahlhausJPSY92 fatcat:2p3wuh7r4nb4tlvgctbywfmsuu

Algorithmic mechanism design (extended abstract)

Noam Nisan, Amir Ronen
1999 Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99  
We also suggest and motivate extensions to the basic model and prove improved upper bounds in the extended model. Many open problems are suggested as well.  ...  We consider algorithmic problems in a distributed setting where the participants annot be assumed to follow the algorithm but rather their own self-interest.  ...  For the similar problem with minimum spanning tree, it has been pointed out to us by Valerie King that the known fully dynamic algorithms (or alternatively the known sensitivityanalysis algorithms) for  ... 
doi:10.1145/301250.301287 dblp:conf/stoc/NisanR99 fatcat:4khbvbrworgvfjd6li3k3rwi4u

Recognizing rectangle of influence drawable graphs (extended abstract) [chapter]

H. ElGindy, G. Liotta, A. Lubiw, H. Meijer, S. H. Whitesides
1995 Lecture Notes in Computer Science  
A minimum spanning tree of P, denoted MST(P), is a spanning tree of P such that the sum of the lengths of the edge-segments is minimum.  ...  Let P be a set of points such that RIG(P) is a tree. Then MST(P) = GG(P) = RIG[P] = RIG(P), and the minimum spanning tree of P is unique.  ... 
doi:10.1007/3-540-58950-3_390 fatcat:di2fvuh3rjb5ln46oajg2d635a

Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract) [chapter]

Ian Post, Chaitanya Swamy
2014 Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms  
Even 1-MLP is known to be MAXSNP-hard for general metrics [8, 23] and NP-hard for tree metrics [26], so we focus on approximation algorithms. Our results and techniques.  ...  Our algorithms are versatile and extend easily to handle various extensions involving: (i) weighted sum of latencies, (ii) constraints specifying P 1 , . . . , P k , where each path P i starts at root  ...  (i) Let B ≥ 0, and O * be the minimum cost of a collection of rooted paths spanning at least B nodes.  ... 
doi:10.1137/1.9781611973730.35 dblp:conf/soda/PostS15 fatcat:o2vuu3dwkzc67g4gglsmw4krzy

Improved Region-Growing and Combinatorial Algorithms fork-Route Cut Problems (Extended Abstract) [chapter]

Guru Guruganesh, Laura Sanità, Chaitanya Swamy
2014 Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms  
The k-route extensions of multiway cut (k-MWC), and the minimum s-t cut problem (k-(s, t)-Cut), are similarly defined.  ...  We study the k-route generalizations of various cut problems, the most general of which is k-route multicut (k-MC) problem, wherein we have r source-sink pairs and the goal is to delete a minimum-cost  ...  (This follows since an optimal solution to the multiway-cut LP is known to be half-integral (see, e.g., [36] ); this implies that 2(cost of an optimal solution) is at least i (cost of a minimum t i -isolating  ... 
doi:10.1137/1.9781611973730.46 dblp:conf/soda/GuruganeshSS15 fatcat:rhsf5h2leveclksbyib4ddgska

Page 2542 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
Rescigno and Ugo Vaccaro, Com- munication complexity of gossiping by packets (234-245); Teresa Przytycka and Lisa Higham, Optimal cost-sensitive distributed minimum spanning tree algorithm (246-258); Vincenzo  ...  Goemans, The constrained minimum spanning tree problem (extended ab- stract) (66-75); Hoong Chuin Lau and Osamu Watanabe, Ran- domized approximation of the constraint satisfaction problem (ex- tended abstract  ... 

Grand challenges: companies and universities working for a better society (Extended Abstracts)

MARTA UGOLINI
2021 Sinergie Italian Journal of Management  
Gli Extended Abstract racconti in questo volume affrontano la tematica con una varietà di argomenti, punti di vista, prospettive.  ...  In the most populated quadrant, that is the one where care, treatment and monitoring aim at fostering physical distance, we found many solutions spanning from IOT applications to robotics.  ...  As this is a comparison of two case studies the expected results will be difficult to extend to other cases without a process of "translation" in the new context they will be confronted with.  ... 
doi:10.7433/srecp.ea.2020.01 fatcat:7tu5ulmovbauzc744x5nxjx2by

Page 2043 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
Using this new representation, we propose an im- proved one-to-all broadcast algorithm, based on a spanning tree of optimal height.  ...  The algorithm provides trade-offs among tree weights, routing costs, and time complexity. We also extend the results to some other related problems.” 2003c:68020 68M12 68M10 90B18 Dobrev, S.  ... 

Page 7266 of Mathematical Reviews Vol. , Issue 98K [page]

1998 Mathematical Reviews  
extended abstract) (202- 211).  ...  ); Lusheng Wang and Xiaohua Jia, Fixed topology Steiner trees and spanning forests with applications in network communications (373-382); Guoliang Xue, A branch-and-bound algorithm for computing node weighted  ... 

Page 2212 of Mathematical Reviews Vol. , Issue 93d [page]

1993 Mathematical Reviews  
Zhang and Qing Feng, On better heuristic for Euclidean Steiner minimum trees (extended abstract) (431-439); Tom Leighton [Frank Thomson Leighton], Yuan Ma and C.  ...  Kung, Communication complexity for parallel divide-and-conquer (151-162).  ... 

Page 2739 of Mathematical Reviews Vol. , Issue 99d [page]

1991 Mathematical Reviews  
Strothmann, Bounded degree spanning trees (extended abstract) (104-117); Krzysztof Diks and Andrzej Pelc, Optimal adaptive broadcasting with a bounded fraction of faulty nodes (extended abstract) (118-  ...  Nilsson, Minimum spanning trees in d dimensions (341-349); Kim S.  ... 

Page 7098 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
abstract) (292-301); Naveen Garg, A 3-approximation for the minimum tree spanning k ver- tices (302-309).  ...  Rabin, Computationally hard algebraic problems (extended abstract) (284-289); Joseph Cheriyan and Ramakrishna Thurimella, Approximating minimum-size k-connected spanning subgraphs via matching (extended  ... 

Page 4199 of Mathematical Reviews Vol. , Issue 99f [page]

1999 Mathematical Reviews  
’s merge sorts as parallel sorting algorithms (410- 420); Jens Gustedt, Minimum spanning trees for minor-closed graph classes in parallel (421-431); Anders Dessmark, Andrzej Lingas, Hans Olsson and Hiroaki  ...  Mohamadou Diallo, Afonso Ferreira and Andrew Rau-Chaplin, Communication-efficient deterministic parallel algorithms for pla- nar point location and 2d Voronoi diagram (399-409); Christine Rub, On Batcher  ... 

Lowering the barrier to applying machine learning

Kayur Patel
2010 Proceedings of the 28th of the international conference extended abstracts on Human factors in computing systems - CHI EA '10  
I found that the key barrier to adoption is not a poor understanding of the machine learning algorithms themselves, but rather a poor understanding of the process for applying those algorithms and insufficient  ...  Specifically, this dissertation focuses on using machine learning algorithms to train a model.  ...  All of these tools are built on common abstractions. Heer and Agarwala have encoded these abstractions as design patterns [56] .  ... 
doi:10.1145/1753846.1753882 dblp:conf/chi/Patel10 fatcat:ctphoo6owzfnpf53ihq7kjix3e

A Steiner tree based approach for the efficient support of multipoint communications in a multi-domain context

Lunde Chen, Slim Abdellatif, Thierry Gayraud, Pascal Berthou
2017 2017 IEEE Symposium on Computers and Communications (ISCC)  
This work proposes an approach based on Steiner trees to efficiently support multipoint communications in a multidomain context, where each domain exposes a synthetic and aggregated view of its network  ...  aggregated networks as well as the global Steiner tree.  ...  G p is used in this paper to compute the optimal (minimum cost) global Steiner tree T p spanning a set of node Z for performance comparison reasons.  ... 
doi:10.1109/iscc.2017.8024549 dblp:conf/iscc/ChenAGB17 fatcat:vcrruyqoofhnbeqaylw2illq6u
« Previous Showing results 1 — 15 out of 16,291 results