- Copyright 1996 Disc. Appl. Math. 69(3):281289. On Strongly Connected Digraphs with Bounded Cycle Length
- arXiv:cs.DS/0205045 Balancing Minimum Spanning Trees
- [1] J. L. Bentley, Communicated by David Johnson. [2] D. Bienstock, M. X. Goemans, D. SimchiLevi and D. P. Williamson, A note on the
- The Directed Minimum-Degree Spanning Tree Problem
- Graph and Network Algorithms SAMIR KHULLER
- [ST] P. Seymour and R. Thomas. Call routing and the rat catcher. Workshop on Algorithms and Combinatorial Optimization, March 1991. Atlanta, GA.
- ALGORITHMS FOR CAPACITATED VEHICLE ROUTING # MOSES CHARIKAR + , SAMIR KHULLER # , AND BALAJI RAGHAVACHARI
- A NetworkFlow Technique for Finding LowWeight BoundedDegree Spanning Trees
- Approximation Algorithms for Mixed Postman Problem Balaji Raghavachari \Lambda Jeyakesavan Veerasamy y
- Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem
- A 3/2-approximation algorithm for the Windy Postman Problem Balaji Raghavachari y Jeyakesavan Veerasamy z
- Course Syllabus CS 6360.003 Database Design; Fall 2011; TR 1:00-2:15; ECSS 2.311; www.utdallas.edu/~rbk/teach/db/
- Course Syllabus CS 4349.002 Advanced Algorithm Design and Analysis; Fall 2011; TR 10:00-11:15; ECSS 2.201;
- Finding redundant FDs When designing tables for a relational database, a functional dependency (FD) is used to express the
- [graph-06-mst] TSP of points in the plane
- 3569 -Degrees of Separation World Finals -San Antonio -Texas -2005/2006
- Many of SKB Kontur programmers like to get to work by Metro because the main office is situated quite close the station Uralmash. So, since a sedentary life requires active exercises off-duty, many of
- Cat and Mouse In a house with many rooms live a cat and a mouse. The cat and the mouse each have chosen one room
- [graph-05-DAG] Project planning
- [graph-02-bfs-radius] Finding the center of a graph
- [dp-06-1dim.txt] Split into k sets to minimize discord
- Shortest paths and street repairs Suppose one has the streets of a city modeled by a graph, where its
- Variable Radix Huffman Encoding Huffman encoding is a method of developing an optimal encoding of the symbols in a source alphabet
- Trade on Verweggistan Since the days of Peter Stuyvesant and Abel Tasman, Dutch merchants have been traveling all over the
- 3752 -Containers World Finals -Tokyo -2006/2007
- Package Pricing The Green Earth Trading Company sells 4 different sizes of energy-efficient fluorescent light bulbs for
- Mr. S. Operator. wants to get a contract approved by a corrupt agency, paying as little bribe as possible. The agency is located in a building with M floors. Each floor has N offices laid out in a row,
- Course Syllabus CS 4347 Database Systems; Spring 2012; MW 5:30-6:45; SLC 2.304; URL: utdallas.edu/~rbk/teach/db/
- Course Syllabus CS 6363.002 Algorithms; Spring 2012; MW 4:00-5:15; ECSS 2.306; URL: utdallas.edu/~rbk/teach/alg/
- Mail Order System (Ex. 3.32) The company has employees, each identified by a
