Steiner Tree is an important NP-hard problem that is often encountered in practice. Examples incl... more Steiner Tree is an important NP-hard problem that is often encountered in practice. Examples include design of multicast trees, design of signal distribution networks, etc. Since it is NP-hard, we cannot expect to design a polynomial-time algorithm that solves it to ...
... OF CONSTANTDEGREE GRAPHS * Andrew V. GOLDBERG * * and Serge A. PLOTKIN Laboratory for Compute... more ... OF CONSTANTDEGREE GRAPHS * Andrew V. GOLDBERG * * and Serge A. PLOTKIN Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, USA ... A valid coloring of a graph is an assignment of a color to each vertex such that no two ...
The Energy Citations Database (ECD) provides access to historical and current research (1948 to t... more The Energy Citations Database (ECD) provides access to historical and current research (1948 to the present) from the Department of Energy (DOE) and predecessor agencies.
Abstract: This project focused on designing fast algorithms for basic combinational optimization ... more Abstract: This project focused on designing fast algorithms for basic combinational optimization problems, including maximum flow, matching, multicommodity flow, and generalized flow. Many important applications are naturally stated as variants of these ...
Abstract: The main goal of this project is to develop fundamental algorithmic techniques that can... more Abstract: The main goal of this project is to develop fundamental algorithmic techniques that can be applied to problems that arise in the context of high-speed communication networks. The explosion in the size and complexity of networks, together with QoS requirements ...
The Energy Citations Database (ECD) provides access to historical and current research (1948 to t... more The Energy Citations Database (ECD) provides access to historical and current research (1948 to the present) from the Department of Energy (DOE) and predecessor agencies.
... OF CONSTANTDEGREE GRAPHS * Andrew V. GOLDBERG * * and Serge A. PLOTKIN Laboratory for Compute... more ... OF CONSTANTDEGREE GRAPHS * Andrew V. GOLDBERG * * and Serge A. PLOTKIN Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, USA ... A valid coloring of a graph is an assignment of a color to each vertex such that no two ...
Abstract: The main goal of this project is to develop fundamental algorithmic techniques that can... more Abstract: The main goal of this project is to develop fundamental algorithmic techniques that can be applied to problems that arise in the context of high speed communications networks. The emphasis is on efficient algorithms for resource management. This research project ...
Steiner Tree is an important NP-hard problem that is often encountered in practice. Examples incl... more Steiner Tree is an important NP-hard problem that is often encountered in practice. Examples include design of multicast trees, design of signal distribution networks, etc. Since it is NP-hard, we cannot expect to design a polynomial-time algorithm that solves it to ...
... OF CONSTANTDEGREE GRAPHS * Andrew V. GOLDBERG * * and Serge A. PLOTKIN Laboratory for Compute... more ... OF CONSTANTDEGREE GRAPHS * Andrew V. GOLDBERG * * and Serge A. PLOTKIN Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, USA ... A valid coloring of a graph is an assignment of a color to each vertex such that no two ...
The Energy Citations Database (ECD) provides access to historical and current research (1948 to t... more The Energy Citations Database (ECD) provides access to historical and current research (1948 to the present) from the Department of Energy (DOE) and predecessor agencies.
Abstract: This project focused on designing fast algorithms for basic combinational optimization ... more Abstract: This project focused on designing fast algorithms for basic combinational optimization problems, including maximum flow, matching, multicommodity flow, and generalized flow. Many important applications are naturally stated as variants of these ...
Abstract: The main goal of this project is to develop fundamental algorithmic techniques that can... more Abstract: The main goal of this project is to develop fundamental algorithmic techniques that can be applied to problems that arise in the context of high-speed communication networks. The explosion in the size and complexity of networks, together with QoS requirements ...
The Energy Citations Database (ECD) provides access to historical and current research (1948 to t... more The Energy Citations Database (ECD) provides access to historical and current research (1948 to the present) from the Department of Energy (DOE) and predecessor agencies.
... OF CONSTANTDEGREE GRAPHS * Andrew V. GOLDBERG * * and Serge A. PLOTKIN Laboratory for Compute... more ... OF CONSTANTDEGREE GRAPHS * Andrew V. GOLDBERG * * and Serge A. PLOTKIN Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, USA ... A valid coloring of a graph is an assignment of a color to each vertex such that no two ...
Abstract: The main goal of this project is to develop fundamental algorithmic techniques that can... more Abstract: The main goal of this project is to develop fundamental algorithmic techniques that can be applied to problems that arise in the context of high speed communications networks. The emphasis is on efficient algorithms for resource management. This research project ...
Uploads
Papers by Serge Plotkin