A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
The Greedy Algorithm Is not Optimal for On-Line Edge Coloring
2021
Preserved Fulltext
Indeed, their work, titled "the greedy algorithm is optimal for on-line edge coloring", shows that the competitive ratio of 2 of the naïve greedy algorithm is best possible online. ...
Nearly three decades ago, Bar-Noy, Motwani and Naor showed that no online edge-coloring algorithm can edge color a graph optimally. ...
I C A L P 2 0 2 1 109:6 The Greedy Algorithm Is not Optimal for On-Line Edge Coloring ▶ Proposition 2.9 (Coupling). ...
doi:10.4230/lipics.icalp.2021.109
fatcat:aortyvuqgjgbxjqhdkasu62zly
On the performance of on-line algorithms for partition problems
1989
Acta Cybernetica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We consider the performance of the greedy algorithm and of on-line algorithms for partition problems in combinatorial optimization. ...
After surveying known results we give bounds for matroid and graph partitioning, and discuss the power of nonadaptive adversaries for proving lower bounds. * Supported by Hungarian Academy of Sciences. ...
We thank Collette Coullard, János Csirik, Gábor Galambos and László Lovász for their valuable remarks. ...
dblp:journals/actaC/FaigleKT89
fatcat:tpyjl2g3orhpfocbiwa64xd5qu
Converter placement supporting broadcast in WDM optical networks
2001
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We call this problem the Converter Placement problem. We model a given network using a graph q with colors on its edges and give a mathematical formulation for the problem based on the graph model. ...
We present an approximation algorithm to solve the Converter Placement problem and study the performance of the algorithm on randomly generated network topologies. ...
ACKNOWLEDGMENTS The authors wish to thank Professor Manuel Blum for helpful discussion and comments. The authors are grateful for the valuable comments given by the anonymous reviewers. ...
doi:10.1109/12.936240
fatcat:54ff3cjvoncn5c6wziesze56ru
Call Control in Rings
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The algorithm is based on a decision procedure that checks whether a solution with at least paths exists, which is in turn implemented by an iterative greedy approach operating in rounds. ...
The goal of the call control problem in rings is to compute, for a given ring network with edge capacities and a set of paths in the ring, a maximum cardinality subset of the paths such that no edge capacity ...
Finally, an optimal off-line call control algorithm is helpful as a benchmark for the evaluation of other off-line or on-line call control strategies. ...
doi:10.1007/3-540-45465-9_67
fatcat:4y5rhqungbd6tjhmhkxmflnt4i
Bi-chromatic minimum spanning trees
2005
European Workshop on Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also consider bounds on the total length of the edges of 1) the planar MST and the unrestricted MST, 2) the greedy planar spanning tree and the unrestricted MST, 3) the greedy planar spanning tree and ...
We give tight upper bounds on the maximum degree of a node in the color conforming minimum weight spanning tree (MST) formed by G and H. ...
For these variants a greedy algorithm like Kruskal's [8] is known to yield the optimal solution [4, 3] . ...
dblp:conf/ewcg/GrantsonMR05
fatcat:anetdv64kfb35o7axfo4gwrrpu
Page 3500 of Mathematical Reviews Vol. , Issue 94f
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
greedy algorithm is optimal for on-line edge coloring. ...
The paper under review shows the greedy algorithm to be optimal, among on-line algorithms, by constructing a graph which forces any on-line edge coloring algorithm to use 2A — 1 colors whether the graph ...
New algorithms for the Minimum Coloring Cut Problem
[article]
2017
arXiv
pre-print
Preserved Fulltext
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.
Other Versions
that the number of colors used by the edges in E' is minimum. ...
The Minimum Coloring Cut Problem is defined as follows: given a connected graph G with colored edges, find an edge cut E' of G (a minimal set of edges whose removal renders the graph disconnected) such ...
Each color is assigned to one or more edges, but each edge e has a unique color c(e). ...
arXiv:1703.09258v2
fatcat:dlqek6nusrbrfbxe2vpoz7no5i
Time Slot Assignment in SS/TDMA Systems with Intersatellite Links
1987
IRE Transactions on Communications Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Successively, we focus our attention on clusters of two satellites, proposing a branch-and-bound optimal algorithm. and two fast heuristic algorithms. ...
We investigate the performance of the proposed heuristic algorithms both by a theoretical worst case bound and by simulation trials showing that the produced solutions are close to the optimal on the average ...
effect of Theorem 1 is that one is forced to abandon the search for efficient algorithms that find optimal solutions. ...
doi:10.1109/tcom.1987.1096831
fatcat:gtp7ze3345e5pfajy6wefvbwd4
Multiconstrained QoS Routing: Greedy is Good
2007
IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Our algorithm is as simple as Dijkstra's shortest path algorithm, and is therefore suitable for implementation in Internet protocols. ...
Extensive computational results show that this greedy algorithm is superior to the previously best known K-approximation algorithm in terms of the quality of the path computed. ...
Whenever a node u is colored black in lines 10-11, we perform a relaxation from node u to node v along the edge (u, v) in lines 14-18, if v is a white node. ...
doi:10.1109/glocom.2007.359
dblp:conf/globecom/XueZ07
fatcat:rizun7c6orcmriyz7gbxbfreje
Competitive analysis for online scheduling in software-defined optical WAN
2017
IEEE INFOCOM 2017 - IEEE Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Due to the tremendous cost of building WANs and the stringent timing requirement of distributed applications, it is critical for network operators to make efficient use of network resources to optimize ...
While these solutions show it is promising to significantly reduce data transfer times by centralized crosslayer control, they do not have any theoretical guarantees on the proposed algorithms. ...
Any edge coloring of H -in particular, the optimal edge coloring of H -can be extended to a valid clique labeling for the cliques {Q u }: the vertex in Q u carries the color of its corresponding edge in ...
doi:10.1109/infocom.2017.8056969
dblp:conf/infocom/JiaJGDG17
fatcat:csqvjbyewfhdpiq4ehq3y43pdq
Greedy Monochromatic Island Partitions
[article]
2024
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2024; you can also visit the original URL.
The file type is application/pdf.
We present three greedy algorithms for constructing island partitions and analyze their approximation ratios. ...
A set of points is monochromatic if it contains points of only one color. An island I is a subset of S such that 𝒞ℋ(I) ∩ S = I, where 𝒞ℋ(I) denotes the convex hull of I. ...
Line-greedy can be implemented to run in O(kOpt L n 2 log n) time [11] , where Opt L is the optimal number of lines and k is the number of colors of the input set. ...
arXiv:2402.13340v1
fatcat:7s6jypkenzg6bmp7hlfymfa7mq
The rainbow spanning forest problem
2017
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Given an undirected and edge colored graph G, a rainbow component of G is a subgraph of G having all the edges with different colors. ...
In this paper we present an integer linear mathematical formulation and a greedy algorithm to solve it. To further improve the results we applied a multi-start scheme to the greedy algorithm. ...
For this reason, the greedy algorithm selects edge (v 3 , v 8 ) and, thanks to this choice, it finds the optimal solution. ...
doi:10.1007/s00500-017-2540-8
fatcat:albelj2r6bdrfehfphr2gos3te
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We present and analyze six algorithms, based on iterative matchings, b-matching, edge coloring, and node-rankings. ...
However, to fully exploit temporal structure in the demand, such fine-grained reconfigurations also require fast algorithms for optimizing the interconnecting matchings. ...
The authors have provided public access to their code at https://doi.org/10.5281/zenodo.5851268. ...
arXiv:2201.06621v1
fatcat:ledcge4gprcmhpemcq6nhx6aom
A NOVEL GREEDY GENETIC ALGORITHM TO SOLVE COMBINATORIAL OPTIMIZATION PROBLEM
2020
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Preserved Fulltext
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.
In this paper, a modified genetic algorithm based on greedy sequential algorithm is presented to solve combinatorial optimization problem. ...
The algorithm proposed here is a hybrid of heuristic and computational intelligence algorithm where greedy sequential algorithm is used as operator inside genetic algorithm like crossover and mutation. ...
For a specified set of vertices, that form a connected graph, the first aim is to colors vertices, on condition that no edge connects two identically colored vertices. ...
doi:10.5194/isprs-archives-xliv-4-w3-2020-117-2020
fatcat:3xycfwcenbajrctfgfr7faxhfi
Algorithms for Tensor Network Contraction Ordering
[article]
2020
arXiv
pre-print
Preserved Fulltext
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.
We compare the obtained contraction sequences and identify signs of highly non-local optimization, with the more sophisticated algorithms sacrificing run-time early in the contraction for better overall ...
We benchmark their performance as well as that of the commonly-used greedy search on physically relevant tensor networks. ...
ACKNOWLEDGEMENTS We thank Miles Stoudenmire for early conversations relating to this work. F. S. thanks Noa Nabeshima for suggesting the use of genetic algorithms and helpful discussions. ...
arXiv:2001.08063v1
fatcat:3i7lysqyuvf7lbmx4pid7ztvgi
« Previous
Showing results 1 — 15 out of 19,092 results