Search Results - "Golin, Mordecai"

Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows by Chen, Di, Golin, Mordecai

“…Let T = ( V , E ) be a tree with associated costs on its subtrees. A minmax k - partition of T is a partition into k subtrees, minimizing the maximum cost of a…”
Get full text

Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries by Golin, Mordecai, Harb, Elfarouk

“…AIFV-2 codes are a new method for constructing lossless codes for memoryless sources that provide better worst-case redundancy than Huffman codes. They do this…”
Get full text

Multiple sink location problems in dynamic path networks by Higashikawa, Yuya, Golin, Mordecai J., Katoh, Naoki

“…This paper considers the k-sink location problem in dynamic path networks. A dynamic path network consists of an undirected path with positive edge lengths,…”
Get full text

Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities by Arumugam, Guru Prakash, Augustine, John, Golin, Mordecai J., Srikanthan, Prashanth

“…In Dynamic flow networks an edge’s capacity is the amount of flow (items) that can enter it in unit time. All flow must be moved to sinks and congestion occurs…”
Get full text

Scheduling with gaps: new models and algorithms by Chrobak, Marek, Golin, Mordecai, Lam, Tak-Wah, Nogneng, Dorian

“…We consider scheduling problems for unit jobs with release times, where the number or size of the gaps in the schedule is taken into consideration, either in…”
Get full text

Minimax regret 1-sink location problem in dynamic path networks by Higashikawa, Yuya, Augustine, John, Cheng, Siu-Wing, Golin, Mordecai J., Katoh, Naoki, Ni, Guanqun, Su, Bing, Xu, Yinfeng

“…This paper considers the minimax regret 1-sink location problem in dynamic path networks. In our model, a dynamic path network consists of an undirected path…”
Get full text

A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes by Golin, Mordecai, Harb, Elfarouk

“…Huffman Codes are optimal Instantaneous Fixed-to-Variable (FV) codes in which every source symbol can only be encoded by one codeword. Relaxing these…”
Get full text

The asymptotic number of spanning trees in circulant graphs by Golin, Mordecai J., Yong, Xuerong, Zhang, Yuanping

“…Let T ( G ) be the number of spanning trees in graph G . In this note, we explore the asymptotics of T ( G ) when G is a circulant graph with given jumps. The…”
Get full text

Competitive facility location: the Voronoi game by Ahn, Hee-Kap, Cheng, Siu-Wing, Cheong, Otfried, Golin, Mordecai, van Oostrum, René

“…We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of…”
Get full text

Chebyshev polynomials and spanning tree formulas for circulant and related graphs by Zhang, Yuanping, Yong, Xuerong, Golin, Mordecai J.

“…Kirchhoff 's Matrix Tree Theorem permits the calculation of the number of spanning trees in any given graph G through the evaluation of the determinant of an…”
Get full text

Minmax regret for sink location on dynamic flow paths with general capacities by Golin, Mordecai, Sandeep, Sai

“…In dynamic flow networks, every vertex starts with items (flow) that need to be shipped to designated sinks. All edges have two associated quantities: length,…”
Get full text

The number of spanning trees in a class of double fixed-step loop networks by Yong, Xuerong, Zhang, Yuanping, Golin, Mordecai J.

“…In this article, we develop a method to count the number of spanning trees in certain classes of double fixed‐step loop networks with nonconstant steps. More…”
Get full text

Online Dynamic Programming Speedups by Bar-Noy, Amotz, Golin, Mordecai J., Zhang, Yan

“…Consider the dynamic program h ( n )=min  1≤ j ≤ n a ( n , j ), where a ( n , j ) is some formula that may (online) or may not (offline) depend on the…”
Get full text

The two-median problem on Manhattan meshes by Golin, Mordecai J., Zhang, Yan

“…We investigate the two‐median problem on a mesh with M columns and N rows (M ≥ N), under the Manhattan (L1) metric. We derive exact algorithms with respect to…”
Get full text

Polynomial Time Algorithms for Constructing Optimal AIFV Codes by Golin, Mordecai, Harb, Elfarouk

“…Huffman Codes are "optimal" Fixed-to-Variable (FV) codes if every source symbol can only be encoded by one codeword. Relaxing this constraint permits…”
Get full text

Online maintenance of k-medians and k-covers on a line by FLEISCHER, Rudolf, GOLIN, Mordecai J, YAN ZHANG

Get full text

A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs by Golin, M.J., Rote, G.

“…We consider the problem of constructing prefix-free codes of minimum cost when the encoding alphabet contains letters of unequal length. The complexity of this…”
Get full text

Scheduling on a graph with release times by Yu, Wei, Golin, Mordecai, Zhang, Guochuan

“…We study a generalization of the well-known traveling salesman problem in a metric space, in which each city is associated with a release time. The salesman…”
Get full text

On the cost of unsuccessful searches in search trees with two-way comparisons by Chrobak, Marek, Golin, Mordecai, Munro, J. Ian, Young, Neal E.

“…Search trees are commonly used to implement access operations to a set of stored keys. If this set is static and the probabilities of membership queries are…”
Get full text

A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes by Sze-Lok Chan, Golin, M.J.

“…The generic Huffman-encoding problem of finding a minimum cost prefix free code is almost completely understood. There still exist many variants of this…”
Get full text